English
Related papers

Related papers: The Panel Complexity of Sortition: Is 12 Angry Men…

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

Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…

Artificial Intelligence · Computer Science 2012-04-18 Toby Walsh

Shortlisting is the process of selecting a subset of alternatives from a larger pool for further consideration or final decision-making. It is widely applied in social choice and multi-agent system scenarios. The growing demand for…

Computer Science and Game Theory · Computer Science 2026-01-30 Edith Elkind , Qishen Han , Lirong Xia

The apportionment problem constitutes a fundamental problem in democratic societies: How to distribute a fixed number of seats among a set of states in proportion to the states' populations? This--seemingly simple--task has led to a rich…

Computer Science and Game Theory · Computer Science 2024-11-01 Javier Cembrano , José Correa , Ulrike Schmidt-Kraepelin , Alexandros Tsigonias-Dimitriadis , Victor Verdugo

The topic of this paper is "gerrymandering", namely the curse of deliberate creations of district maps with highly asymmetric electoral outcomes to disenfranchise voters, and it has a long legal history. Measuring and eliminating…

Computational Complexity · Computer Science 2020-08-05 Tanima Chatterjee , Bhaskar DasGupta

This paper deals with the scenario approach to robust optimization. This relies on a random sampling of the possibly infinite number of constraints induced by uncertainties in the parameters of an optimization problem. Solving the resulting…

Optimization and Control · Mathematics 2023-03-08 Fabien Lauer

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…

Data Structures and Algorithms · Computer Science 2011-07-22 Hakob Aslanyan

Citizens' assemblies - small panels of citizens that convene to deliberate on policy issues - often face the issue of panelists dropping out at the last-minute. Without intervention, these dropouts compromise the size and representativeness…

Computer Science and Game Theory · Computer Science 2025-11-24 Maya Pal Gambhir , Bailey Flanigan , Aaron Roth

Public opinion polling is usually done by random sampling from the entire population, treating individual opinions as independent. In the real world, individuals' opinions are often correlated, e.g., among friends in a social network. In…

Social and Information Networks · Computer Science 2016-11-28 Weiran Huang , Liang Li , Wei Chen

In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome. This concept has been investigated extensively, but…

Computer Science and Game Theory · Computer Science 2023-12-11 Yannai A. Gonczarowski , Gregory Kehne , Ariel D. Procaccia , Ben Schiffer , Shirley Zhang

Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet…

Machine Learning · Computer Science 2018-03-13 Haizi Yu , Tianxi Li , Lav R. Varshney

Many real-world scenarios require the random selection of one or more individuals from a pool of eligible candidates. One example of especial social relevance refers to the legal system, in which the jurors and judges are commonly picked…

Apportionment is the problem of distributing $h$ indivisible seats across states in proportion to the states' populations. In the context of the US House of Representatives, this problem has a rich history and is a prime example of…

Computer Science and Game Theory · Computer Science 2024-06-21 Paul Gölz , Dominik Peters , Ariel D. Procaccia

Clustering is an unsupervised learning task that aims to partition data into a set of clusters. In many applications, these clusters correspond to real-world constructs (e.g. electoral districts) whose benefit can only be attained by groups…

Machine Learning · Computer Science 2023-02-09 Connor Lawless , Oktay Gunluk

A central feature of many deliberative processes, such as citizens' assemblies and deliberative polls, is the opportunity for participants to engage directly with experts. While participants are typically invited to propose questions for…

Artificial Intelligence · Computer Science 2026-04-28 Soham De , Lodewijk Gelauff , Ashish Goel , Smitha Milli , Ariel Procaccia , Alice Siu

We here present an improved version of the Sortition Foundation's GROUPSELECT software package, which aims to repeatedly allocate participants of a deliberative process to discussion groups in a way that balances demographics in each group…

Human-Computer Interaction · Computer Science 2024-11-08 Jake Barrett , Philipp C Verpoort , Kobi Gal

An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems. These kinds of voting strategies are often tempting at the…

Artificial Intelligence · Computer Science 2012-04-20 Andrew Lin

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

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

Population protocols are a relatively novel computational model in which very resource-limited anonymous agents interact in pairs with the goal of computing predicates. We consider the probabilistic version of this model, which naturally…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Vladyslav Melnychuk