Six Candidates Suffice to Win a Voter Majority
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian, Vetta, Kangning Wang

TL;DR
This paper proves that for any number of candidates and voters, there always exists a small committee of size 6 that is preferred over any other candidate by a majority, extending previous results on Condorcet winning sets.
Contribution
It establishes the existence of Condorcet winning sets of size 6 universally, and provides a general condition relating committee size and voter preference fractions.
Findings
Condorcet winning sets of size 6 always exist.
A general condition relates committee size to voter preference fractions.
First nontrivial results for all committee sizes greater than or equal to 2.
Abstract
A cornerstone of social choice theory is Condorcet's paradox which says that in an election where voters rank candidates it is possible that, no matter which candidate is declared the winner, a majority of voters would have preferred an alternative candidate. Instead, can we always choose a small committee of winning candidates that is preferred to any alternative candidate by a majority of voters? Elkind, Lang, and Saffidine raised this question and called such a committee a Condorcet winning set. They showed that winning sets of size may not exist, but sets of size logarithmic in the number of candidates always do. In this work, we show that Condorcet winning sets of size always exist, regardless of the number of candidates or the number of voters. More generally, we show that if , then there always exists a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPublic Administration and Governance
