English
Related papers

Related papers: A characterization of proportionally representativ…

200 papers

We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…

Computer Science and Game Theory · Computer Science 2023-09-22 Martin Lackner , Piotr Skowron

There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…

Computer Science and Game Theory · Computer Science 2015-05-12 Ben Wise , Steven Bankes

We study two notions of stability in multiwinner elections that are based on the Condorcet criterion. The first notion was introduced by Gehrlein: A committee is stable if each committee member is preferred to each non-member by a (possibly…

Computer Science and Game Theory · Computer Science 2017-01-30 Haris Aziz , Edith Elkind , Piotr Faliszewski , Martin Lackner , Piotr Skowron

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

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

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

We investigate two systems of fully proportional representation suggested by Chamberlin Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination…

Computer Science and Game Theory · Computer Science 2014-02-05 Nadja Betzler , Arkadii Slinko , Johannes Uhlmann

A cornerstone of social choice theory is Condorcet's paradox which says that in an election where $n$ voters rank $m$ candidates it is possible that, no matter which candidate is declared the winner, a majority of voters would have…

Computer Science and Game Theory · Computer Science 2025-04-23 Moses Charikar , Alexandra Lassota , Prasanna Ramakrishnan , Adrian Vetta , Kangning Wang

We contribute to the programme of lifting proportionality axioms from the multi-winner voting setting to participatory budgeting. We define novel proportionality axioms for participatory budgeting and test them on known…

Computer Science and Game Theory · Computer Science 2022-05-05 Maaike Los , Zoé Christoff , Davide Grossi

We consider the problem of committee selection from a fixed set of candidates where each candidate has multiple quantifiable attributes. To select the best possible committee, instead of voting for a candidate, a voter is allowed to approve…

Computer Science and Game Theory · Computer Science 2020-08-17 Venkateswara Rao Kagita , Arun K Pujari , Vineet Padmanabhan , Vikas Kumar

In multiwinner approval voting, forming a committee that proportionally represents voters' approval ballots is an essential task. The notion of justified representation (JR) demands that any large "cohesive" group of voters should be…

Computer Science and Game Theory · Computer Science 2025-01-22 Yusuf Hakan Kalayci , Jiasen Liu , David Kempe

A recent work by Hern\'andez et al. introduced a networked voting rule supported by a trust-based social network, where indications of possible representatives were based on individuals opinions. Individual contributions went beyond a…

Physics and Society · Physics 2020-07-01 Alexis R. Hernandez , Carlos Gracia-Lazaro , Edgardo Brigatti , Yamir Moreno

American democracy is currently heavily reliant on plurality in single-member districts, or PSMD, as a system of election. But public perceptions of fairness are often keyed to partisan proportionality, or the degree of congruence between…

Computers and Society · Computer Science 2023-08-23 Moon Duchin , Gabe Schoenbach

To devise efficient solutions for approximating a mean partition in consensus clustering, Dimitriadou et al. [3] presented a necessary condition of optimality for a consensus function based on least square distances. We show that their…

Machine Learning · Computer Science 2016-04-27 Brijnesh J. Jain

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

Computer Science and Game Theory · Computer Science 2023-12-14 Markus Brill , Jannik Peters

Proportional representation (PR) has long been believed the ideal system for the equality of individuals in apportioning the seats of a legislature body to subgroups. We observe that PR implicitly assumes the (standard) number of…

Physics and Society · Physics 2023-05-16 Liang Zhao , Akiko Tanimoto , Wenruo Lyu

We study situations where a group of voters need to take a collective decision over a number of public issues, with the goal of getting a result that reflects the voters' opinions in a proportional manner. Our focus is on interconnected…

Computer Science and Game Theory · Computer Science 2025-09-25 Julian Chingoma , Umberto Grandi , Arianna Novaro

In the late 19th century, Swedish mathematician Lars Edvard Phragm\'{e}n proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two…

Computer Science and Game Theory · Computer Science 2023-02-07 Markus Brill , Rupert Freeman , Svante Janson , Martin Lackner

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…

Computer Science and Game Theory · Computer Science 2021-08-05 Grzegorz Pierczyński , Piotr Skowron