English
Related papers

Related papers: Temporal Panel Selection in Ongoing Citizens' Asse…

200 papers

Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but…

Machine Learning · Computer Science 2025-08-13 Angelos Assos , Carmel Baharav , Bailey Flanigan , Ariel Procaccia

A citizens' assembly is a group of people who are randomly selected to represent a larger population in a deliberation. While this approach has successfully strengthened democracy, it has certain limitations that suggest the need for…

Computer Science and Game Theory · Computer Science 2025-03-03 Daniel Halpern , Ariel D. Procaccia , Ehud Shapiro , Nimrod Talmon

Citizens' assemblies are a form of democratic innovation in which a randomly selected panel of constituents deliberates on questions of public interest. We study a novel goal for the selection of panel members: maximizing the entropy of the…

Computer Science and Game Theory · Computer Science 2026-04-06 Gabriel de Azevedo , Paul Gölz

Sortition is a political system in which decisions are made by panels of randomly selected citizens. The process for selecting a sortition panel is traditionally thought of as uniform sampling without replacement, which has strong fairness…

Computer Science and Game Theory · Computer Science 2020-10-30 Bailey Flanigan , Paul Gölz , Anupam Gupta , Ariel Procaccia

Sortition is based on the idea of choosing randomly selected representatives for decision making. The main properties that make sortition particularly appealing are fairness -- all the citizens can be selected with the same probability --…

Computer Science and Game Theory · Computer Science 2024-06-04 Soroush Ebadian , Evi Micha

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

Sortition is the practice of delegating public decision-making to randomly selected panels. Recently, it has gained momentum worldwide through its use in citizens' assemblies, sparking growing interest within the computer science community.…

Computer Science and Game Theory · Computer Science 2025-05-20 Johannes Brustle , Simone Fioravanti , Tomasz Ponitka , Jeremy Vollen

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Computer Science and Game Theory · Computer Science 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

Multiwinner voting captures a wide variety of settings, from parliamentary elections in democratic systems to product placement in online shopping platforms. There is a large body of work dealing with axiomatic characterizations,…

Computer Science and Game Theory · Computer Science 2023-12-12 Edith Elkind , Svetlana Obraztsova , Nicholas Teh

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

Traditionally, the problem of apportioning the seats of a legislative body has been viewed as a one-shot process with no dynamic considerations. While this approach is reasonable for some settings, dynamic aspects play an important role in…

Computer Science and Game Theory · Computer Science 2025-10-17 Javier Cembrano , Jose Correa , Svenja M. Griesbach , Victor Verdugo

The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols present an elegant and robust model for randomized distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-23 Adam Gańczorz , Leszek Gąsieniec , Tomasz Jurdziński , Jakub Kowalski , Grzegorz Stachowiak

As the world's democratic institutions are challenged by dissatisfied citizens, political scientists and also computer scientists have proposed and analyzed various (innovative) methods to select representative bodies, a crucial task in…

Multiagent Systems · Computer Science 2023-04-07 Manon Revel , Niclas Boehmer , Rachael Colley , Markus Brill , Piotr Faliszewski , Edith Elkind

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…

Machine Learning · Computer Science 2025-11-03 Tianyi Qiu

Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the legitimacy of elected bodies, the electoral processes should…

Computers and Society · Computer Science 2022-06-01 Florian Evéquoz , Johan Rochel , Vijay Keswani , L. Elisa Celis

Recent works have studied the design of algorithms for selecting representative sortition panels. However, the most central question remains unaddressed: Do these panels reflect the entire population's opinion? We present a positive answer…

Computer Science and Game Theory · Computer Science 2024-06-05 Ioannis Caragiannis , Evi Micha , Jannik Peters

A population protocol describes a set of state change rules for a population of $n$ indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-04-19 Adrian Kosowski , Przemysław Uznański

Given a sequence of sets, where each set has a timestamp and contains an arbitrary number of elements, temporal sets prediction aims to predict the elements in the subsequent set. Previous studies for temporal sets prediction mainly focus…

Machine Learning · Computer Science 2023-08-29 Le Yu , Zihang Liu , Leilei Sun , Bowen Du , Chuanren Liu , Weifeng Lv

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve…

Computer Science and Game Theory · Computer Science 2021-05-03 Martin Lackner , Jan Maly
‹ Prev 1 2 3 10 Next ›