English
Related papers

Related papers: Justified Representation: From Hare to Droop

200 papers

A Ranked candidate voting method based on Phragmen's procedure is described that can be used to produce a top-down proportional candidate list. The method complies with the Droop proportionality criterion satisfied by Single Transferable…

Theoretical Economics · Economics 2026-04-14 Ross Hyman

We study approval-based committee voting from a novel perspective. While extant work largely centers around proportional representation of the voters, we shift our focus to the candidates while preserving proportionality. Intuitively,…

Computer Science and Game Theory · Computer Science 2025-06-24 Gregory Kehne , Ulrike Schmidt-Kraepelin , Krzysztof Sornat

The goal of this paper is twofold. First and foremost, we aim to experimentally and quantitatively show that the choice of a multiwinner voting rule can play a crucial role on the way minorities are represented. We also test the possibility…

Computer Science and Game Theory · Computer Science 2016-04-11 Piotr Faliszewski , Jean-Francois Laslier , Robert Schaefer , Piotr Skowron , Arkadii Slinko , Nimrod Talmon

Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…

Computer Science and Game Theory · Computer Science 2022-11-28 Kunal Relia

To choose a suitable multiwinner voting rule is a hard and ambiguous task. Depending on the context, it varies widely what constitutes the choice of an ``optimal'' subset of alternatives. In this paper, we provide a quantitative analysis of…

Multiagent Systems · Computer Science 2020-09-01 Martin Lackner , Piotr Skowron

While proportionality is frequently named as a desirable property of voting rules, its interpretation in multiwinner voting differs significantly from that in apportionment. We aim to bridge these two distinct notions of proportionality by…

Computer Science and Game Theory · Computer Science 2026-02-11 Daria Boratyn , Dariusz Stolicki

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…

Computer Science and Game Theory · Computer Science 2022-03-31 Markus Brill , Paul Gölz , Dominik Peters , Ulrike Schmidt-Kraepelin , Kai Wilker

Direct democracy is a special case of an ensemble of classifiers, where every person (classifier) votes on every issue. This fails when the average voter competence (classifier accuracy) falls below 50%, which can happen in noisy settings…

Computer Science and Game Theory · Computer Science 2018-07-23 Malik Magdon-Ismail , Lirong Xia

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

Computer Science and Game Theory · Computer Science 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

We study the problem of fair sequential decision making given voter preferences. In each round, a decision rule must choose a decision from a set of alternatives where each voter reports which of these alternatives they approve. Instead of…

Computer Science and Game Theory · Computer Science 2025-03-18 Nikhil Chandak , Shashwat Goel , Dominik Peters

The well-known Condorcet Jury Theorem states that, under majority rule, the better of two alternatives is chosen with probability approaching one as the population grows. We study an asymmetric setting where voters face varying…

Computer Science and Game Theory · Computer Science 2025-10-22 Reshef Meir , Ganesh Ghalme

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

Consider the decision-making setting where agents elect a panel by expressing both positive and negative preferences. Prominently, in constitutional AI, citizens democratically select a slate of ethical preferences on which a foundation…

Computer Science and Game Theory · Computer Science 2025-03-05 Sonja Kraiczy , Georgios Papasotiropoulos , Grzegorz Pierczyński , Piotr Skowron

In many proportional parliamentary elections, electoral thresholds (typically 3-5%) are used to promote stability and governability by preventing the election of parties with very small representation. However, these thresholds often result…

Computer Science and Game Theory · Computer Science 2025-03-24 Théo Delemazure , Rupert Freeman , Jérôme Lang , Jean-François Laslier , Dominik Peters

Proportional representation plays a crucial role in electoral systems. In ordinal elections, where voters rank candidates based on their preferences, the Single Transferable Vote (STV) is the most widely used proportional voting method. STV…

Computer Science and Game Theory · Computer Science 2025-05-02 Tuva Bardal , Markus Brill , David McCune , Jannik Peters

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

Arrow's Theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or…

Probability · Mathematics 2021-09-27 Frederic Koehler , Elchanan Mossel