Condorcet winner criterion
| A joint Politics and Economics series |
| Social choice and electoral systems |
|---|
 |
 Mathematics portal |
A Condorcet (French: [kɔ̃dɔʁsɛ], English: /kɒndɔːrˈseɪ/) winner is a candidate who would receive the support of more than half of the electorate in a one-on-one race against any one of their opponents. Voting systems where a majority winner will always win are said to satisfy the Condorcet winner criterion. The Condorcet winner criterion extends the principle of majority rule to elections with multiple candidates.[1][2]
The Condorcet winner is also called a majority winner, a majority-preferred candidate,[3][4][5] a beats-all winner, or tournament winner (by analogy with round-robin tournaments). A Condorcet winner may not necessarily always exist in a given electorate: it is possible to have a rock, paper, scissors-style cycle, when multiple candidates defeat each other (Rock < Paper < Scissors < Rock). This is called Condorcet's voting paradox,[6] and is analogous to the counterintuitive intransitive dice phenomenon known in probability. However, the Smith set, a generalization of the Condorcet criteria that is the smallest set of candidates that are pairwise unbeaten by every candidate outside of it, will always exist.
If voters are arranged on a sole 1-dimensional axis, such as the left-right political spectrum for a common example, and always prefer candidates who are more similar to themselves, a majority-rule winner always exists and is the candidate whose ideology is most representative of the electorate, a result known as the median voter theorem.[7] However, in real-life political electorates are inherently multidimensional, and the use of a one- or even two-dimensional model of such electorates would be inaccurate.[8][9] Previous research has found cycles to be somewhat rare in real elections, with estimates of their prevalence ranging from 1-10% of races.[10]
Systems that guarantee the election of a Condorcet winners (when one exists) include Ranked Pairs, Schulze's method, and the Tideman alternative method. Methods that do not guarantee that the Cordorcet winner will be elected, even when one does exist, include instant-runoff voting (often called ranked-choice in the United States), First-past-the-post voting, and the two-round system. Most rated systems, like score voting and highest median, fail the majority winner criterion.
History
[edit]Condorcet methods were first studied in detail by the Spanish philosopher and theologian Ramon Llull in the 13th century, during his investigations into church governance. Because his manuscript Ars Electionis was lost soon after his death, his ideas were overlooked for the next 500 years.[11]
The first revolution in voting theory coincided with the rediscovery of these ideas during the Age of Enlightenment by Nicolas de Caritat, Marquis de Condorcet, a mathematician and political philosopher.
Example
[edit]Suppose the government comes across a windfall source of funds. There are three options for what to do with the money. The government can spend it, use it to cut taxes, or use it to pay off the debt. The government holds a vote where it asks citizens which of two options they would prefer, and tabulates the results as follows:
| ... vs. Spend more | ... vs. Cut taxes | ||
|---|---|---|---|
| Pay debt | 403–305 | 496–212 | 2–0 
|
| Cut taxes | 522–186 | 1–1 | |
| Spend more | 0–2 | ||
In this case, the option of paying off the debt is the beats-all winner, because repaying debt is more popular than the other two options. But, it is worth noting that such a winner will not always exist. In this case, tournament solutions search for the candidate who is closest to being an undefeated champion.
Majority-rule winners can be determined from rankings by counting the number of voters who rated each candidate higher than another.
Desirable properties
[edit]The Condorcet criterion is related to several other voting system criteria.
Stability (no-weak-spoilers)
[edit]Condorcet methods are highly resistant to spoiler effects. Intuitively, this is because the only way to dislodge a Condorcet winner is by beating them, implying spoilers can exist only if there is no majority-rule winner.
Participation
[edit]One disadvantage of majority-rule methods is they can all theoretically fail the participation criterion in constructed examples. However, studies suggest this is empirically rare for modern Condorcet methods, like ranked pairs. One study surveying 306 publicly-available election datasets found no examples of participation failures for methods in the ranked pairs-minimax family.[12]
Majoritarian criteria
[edit]The Condorcet criterion implies the majority criterion since a candidate ranked first by a majority is clearly ranked above every other candidate by a majority.
When a Condorcet winner exists, this candidate is also part of the smallest mutual majority set, so any Condorcet method passes the mutual majority criterion and Condorcet loser in elections where a Condorcet winner exist. However, this need not hold in full generality: for instance, the minimax Condorcet method fails the Condorcet loser and mutual majority criteria.
Stronger criteria
[edit]The Smith criterion guarantees an even stronger kind of majority rule. It says that if there is no majority-rule winner, the winner must be in the top cycle, which includes all the candidates who can beat every other candidate, either directly or indirectly. Most, but not all, Condorcet systems satisfy the top-cycle criterion.
By method
[edit]List
[edit]Pass
[edit]Most sensible tournament solutions satisfy the Condorcet criterion. Other methods satisfying the criterion include:
- Black
- Kemeny-Young
- Dodgson's method
- Minimax
- Baldwin's method
- Ranked pairs
- Schulze
- Total Vote Runoff
- Tideman's alternative method
See Category:Condorcet methods for more.
Fail
[edit]The following voting systems do not satisfy the Condorcet criterion:
- Plurality voting
- Instant-runoff voting
- Borda count
- Approval Voting
- Coombs' rule[13]
- Bucklin voting (and the closely related median voting)
- Score Voting
Examples of Failures
[edit]Plurality voting
[edit]With plurality voting, the full set of voter preferences is not recorded on the ballot and so cannot be deduced therefrom (e.g. following a real election). Plurality fails the Condorcet criterion because of vote-splitting effects.
Consider an election in which 30% of the voters prefer candidate A to candidate B to candidate C and vote for A, 30% of the voters prefer C to A to B and vote for C, and 40% of the voters prefer B to A to C and vote for B. Candidate B would win (with 40% of the vote) even though A would be the Condorcet winner, beating B 60% to 40%, and C 70% to 30%.
A real-life example may be the 2000 election in Florida, where most voters preferred Al Gore to George Bush, but Bush won as a result of spoiler candidate Ralph Nader.
Instant-runoff voting
[edit]In instant-runoff voting (IRV) voters rank candidates from first to last. The last-place candidate (the one with the fewest first-place votes) is eliminated; the votes are then reassigned to the non-eliminated candidate the voter would have chosen had the candidate not been present.
Instant-runoff does not comply with the Condorcet criterion, i.e. it is possible for it to elect a candidate that could lose in a head to head contest against another candidate in the election. For example, the following vote count of preferences with three candidates {A, B, C}:
- A > B > C: 35
- C > B > A: 34
- B > C > A: 31
In this case, B is preferred to A by 65 votes to 35, and B is preferred to C by 66 to 34, so B is preferred to both A and C. B must then win according to the Condorcet criterion. Under IRV, B is ranked first by the fewest voters and is eliminated, and then C wins with the transferred votes from B.
Note that 65 voters, a majority, prefer either candidate B or C over A; since IRV passes the mutual majority criterion, it guarantees one of B and C must win. If candidate A, an irrelevant alternative under IRV, was not running, a majority of voters would consider B their 1st choice, and IRV's mutual majority compliance would thus ensure B wins.
One real-life example of instant runoff failing the Condorcet criteria was the 2009 mayoral election of Burlington, Vermont.
Borda count
[edit]Borda count is a voting system in which voters rank the candidates in an order of preference. Points are given for the position of a candidate in a voter's rank order. The candidate with the most points wins.
The Borda count does not comply with the Condorcet criterion in the following case. Consider an election consisting of five voters and three alternatives, in which three voters prefer A to B and B to C, while two of the voters prefer B to C and C to A. The fact that A is preferred by three of the five voters to all other alternatives makes it a beats-all champion. However the Borda count awards 2 points for 1st choice, 1 point for second and 0 points for third. Thus, from three voters who prefer A, A receives 6 points (3 × 2), and 0 points from the other two voters, for a total of 6 points. B receives 3 points (3 × 1) from the three voters who prefer A to B to C, and 4 points (2 × 2) from the other two voters who prefer B to C to A. With 7 points, B is the Borda winner.
Bucklin/Median
[edit]Highest medians is a system in which the voter gives all candidates a rating out of a predetermined set (e.g. {"excellent", "good", "fair", "poor"}). The winner of the election would be the candidate with the best median rating. Consider an election with three candidates A, B, C.
- 35 voters rate candidate A "excellent", B "fair", and C "poor",
- 34 voters rate candidate C "excellent", B "fair", and A "poor", and
- 31 voters rate candidate B "excellent", C "good", and A "poor".
B is preferred to A by 65 votes to 35, and B is preferred to C by 66 to 34. Hence, B is the beats-all champion. But B only gets the median rating "fair", while C has the median rating "good"; as a result, C is chosen as the winner by highest medians.
Approval voting
[edit]Main article: Approval voting
Approval voting is a system in which the voter can approve of (or vote for) any number of candidates on a ballot. Approval voting fails the Condorcet criterion
Consider an election in which 70% of the voters prefer candidate A to candidate B to candidate C, while 30% of the voters prefer C to B to A. If every voter votes for their top two favorites, Candidate B would win (with 100% approval) even though A would be the Condorcet winner.
Score voting
[edit]Score voting is a system in which the voter gives all candidates a score on a predetermined scale (e.g. from 0 to 5). The winner of the election is the candidate with the highest total score. Score voting fails the Condorcet criterion. For example:
Candidates Votes
|
A | B | C |
|---|---|---|---|
| 45 | 5/5 | 1/5 | 0/5 |
| 40 | 0/5 | 1/5 | 5/5 |
| 15 | 2/5 | 5/5 | 4/5 |
| Average | 2.55 | 1.6 | 2.6 |
Here, C is declared winner, even though a majority of voters would prefer B; this is because the supporters of C are much more enthusiastic about their favorite candidate than the supporters of B. The same example also shows that adding a runoff does not always cause score to comply with the criterion (as the Condorcet winner B is not in the top-two according to score).
Further reading
[edit]- Black, Duncan (1958). The Theory of Committees and Elections. Cambridge University Press.
- Farquharson, Robin (1969). Theory of Voting. Oxford: Blackwell. ISBN 0-631-12460-8.
- Sen, Amartya Kumar (1970). Collective Choice and Social Welfare. Holden-Day. ISBN 978-0-8162-7765-0.
See also
[edit]- Condorcet loser criterion
- Condorcet method
- Multiwinner voting - contains information on some multiwinner variants of the Condorcet criterion.
References
[edit]- ^ Lepelley, Dominique; Merlin, Vincent (1998). "Choix social positionnel et principe majoritaire". Annales d'Économie et de Statistique (51): 29–48. doi:10.2307/20076136. ISSN 0769-489X. JSTOR 20076136.
- ^ Fishburn, Peter C. (1977). "Condorcet Social Choice Functions". SIAM Journal on Applied Mathematics. 33 (3): 469–489. doi:10.1137/0133030. ISSN 0036-1399. JSTOR 2100704.
- ^ Brandl, Florian; Brandt, Felix; Seedig, Hans Georg (2016). "Consistent Probabilistic Social Choice". Econometrica. 84 (5): 1839–1880. arXiv:1503.00694. doi:10.3982/ECTA13337. ISSN 0012-9682.
- ^ Sen, Amartya (2020). "Majority decision and Condorcet winners". Social Choice and Welfare. 54 (2/3): 211–217. doi:10.1007/s00355-020-01244-4. ISSN 0176-1714. JSTOR 45286016.
- ^ Lewyn, Michael (2012), Two Cheers for Instant Runoff Voting (SSRN Scholarly Paper), Rochester, NY, SSRN 2276015, retrieved 2024-04-21
{{citation}}: CS1 maint: location missing publisher (link) - ^ Fishburn, Peter C. (1977). "Condorcet Social Choice Functions". SIAM Journal on Applied Mathematics. 33 (3): 469–489. doi:10.1137/0133030. ISSN 0036-1399.
- ^ Black, Duncan (1948). "On the Rationale of Group Decision-making". The Journal of Political Economy. 56 (1): 23–34. doi:10.1086/256633. JSTOR 1825026. S2CID 153953456.
- ^ Alós-Ferrer, Carlos; Granić, Đura-Georg (2015-09-01). "Political space representations with approval data". Electoral Studies. 39: 56–71. doi:10.1016/j.electstud.2015.04.003. hdl:1765/111247.
The analysis reveals that the underlying political landscapes ... are inherently multidimensional and cannot be reduced to a single left-right dimension, or even to a two-dimensional space.
- ^ Black, Duncan; Newing, R.A. (2013-03-09). McLean, Iain S. [in Welsh]; McMillan, Alistair; Monroe, Burt L. (eds.). The Theory of Committees and Elections by Duncan Black and Committee Decisions with Complementary Valuation by Duncan Black and R.A. Newing. Springer Science & Business Media. ISBN 9789401148603.
For instance, if preferences are distributed spatially, there need only be two or more dimensions to the alternative space for cyclic preferences to be almost inevitable
- ^ Van Deemen, Adrian (2014-03-01). "On the empirical relevance of Condorcet's paradox". Public Choice. 158 (3): 311–330. doi:10.1007/s11127-013-0133-3. ISSN 1573-7101.
- ^ Colomer, Josep M. (February 2013). "Ramon Llull: from 'Ars electionis' to social choice theory". Social Choice and Welfare. 40 (2): 317–328. doi:10.1007/s00355-011-0598-2.
- ^ Mohsin, F., Han, Q., Ruan, S., Chen, P. Y., Rossi, F., & Xia, L. (2023, May). Computational Complexity of Verifying the Group No-show Paradox. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (pp. 2877-2879).
- ^ Felsenthal, Dan; Tideman, Nicolaus (2013). "Varieties of failure of monotonicity and participation under five voting methods". Theory and Decision. 75 (1): 59–77. doi:10.1007/s11238-012-9306-7.