Algorithmic Problems in Large-Scale Deliberative Democracy

The ambition of online deliberation is to scale participatory decision-making from synchronous in-person interaction, typical of small groups (e.g., a panel, a jury), to asynchronous online interaction in large crowds.

This upscaling requires algorithmic solutions to a number of information dissemination and processing problems. For example, in platforms like Pol.is, participants are presented with a ‘summary’ of the current state of the deliberation, which can help participants to identify possible compromise/consensus positions. Such summaries are the result of complex algorithmic information processing. But do those algorithms satisfy core democratic standards such as equal treatment of participants and fair representation of opinions? Or, in general, that they promote high-quality deliberation? In this talk I will review some of the core algorithmic problems at play in the computational support of online deliberation, the way they are currently solved, and where - in my view - research towards better algorithms is needed.

Speaker: Davide Grossi (RU Groningen)