English
Related papers

Related papers: Super Condorcet Winners and Limit Coalitional Mani…

200 papers

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

Social decision schemes (SDSs) map the preferences of a group of voters over some set of $m$ alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard implies that there…

Theoretical Economics · Economics 2022-01-26 Felix Brandt , Patrick Lederer , René Romen

We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…

Computer Science and Game Theory · Computer Science 2017-07-28 Dominik Peters

Voting rules allow multiple agents to aggregate their preferences in order to reach joint decisions. Perhaps one of the most important desirable properties in this context is Condorcet-consistency, which requires that a voting rule should…

Computer Science and Game Theory · Computer Science 2016-02-26 Felix Brandt , Christian Geist , Dominik Peters

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Typical voting rules do not work well in settings with many candidates. If there are just several hundred candidates, then even a simple task such as choosing a top candidate becomes impractical. Motivated by the hope of developing group…

Computer Science and Game Theory · Computer Science 2012-10-03 Ashish Goel , David Lee

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

Several election districts in the US have recently moved to ranked-choice voting (RCV) to decide the results of local elections. RCV allows voters to rank their choices, and the results are computed in rounds, eliminating one candidate at a…

Computers and Society · Computer Science 2022-06-28 Alborz Jelvani , Amélie Marian

Level-1 Consensus is a property of a preference-profile. Intuitively, it means that there exists a preference relation which induces an ordering of all other preferences such that frequent preferences are those that are more similar to it.…

Computer Science and Game Theory · Computer Science 2017-12-20 Mor Nitzan , Shmuel Nitzan , Erel Segal-Halevi

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

We investigate winner determination for two popular proportional representation systems: the Monroe and Chamberlin-Courant (abbrv. CC) systems. Our study focuses on (nearly) single-peaked resp. single-crossing preferences. We show that for…

Multiagent Systems · Computer Science 2023-08-01 Jiehua Chen , Christian Hatschka , Sofia Simola

We study the complexity of winner determination in single-crossing elections under two classic fully proportional representation rules---Chamberlin--Courant's rule and Monroe's rule. Winner determination for these rules is known to be…

Computer Science and Game Theory · Computer Science 2013-07-05 Piotr Skowron , Lan Yu , Piotr Faliszewski , Edith Elkind

We study the design of voting rules in the metric distortion framework. It is known that any deterministic rule suffers distortion of at least $3$, and that randomized rules can achieve distortion strictly less than $3$, often at the cost…

Computer Science and Game Theory · Computer Science 2026-02-10 Ziyi Cai , D. D. Gao , Prasanna Ramakrishnan , Kangning Wang

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , Toby Walsh , Lirong Xia

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

Risk-limiting post election audits guarantee a high probability of correcting incorrect election results, independent of why the result was incorrect. Ballot-polling audits select ballots at random and interpret those ballots as evidence…

Data Structures and Algorithms · Computer Science 2019-10-30 Michelle Blom , Peter J. Stuckey , Vanessa Teague

We investigate the complexity of {\sc{Constructive Control by Adding/Deleting Votes}} (CCAV/CCDV) for $r$-approval, Condorcet, Maximin and Copeland$^{\alpha}$ in $k$-axes and $k$-candidates partition single-peaked elections. In general, we…

Computer Science and Game Theory · Computer Science 2020-02-11 Yongjie Yang

We prove that there is no preferential voting method satisfying the Condorcet winner and loser criteria, positive involvement (if a candidate $x$ wins in an initial preference profile, then adding a voter who ranks $x$ uniquely first cannot…

Theoretical Economics · Economics 2026-02-20 Wesley H. Holliday

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to aggregate the votes into a single unified proposal is…

Computer Science and Game Theory · Computer Science 2025-02-21 Carmel Baharav , Andrei Constantinescu , Roger Wattenhofer