Condorcet efficiency
.svg)
.svg)
Condorcet efficiency is a measurement of the performance of voting methods. It is defined as the percentage of elections for which the Condorcet winner (the candidate who is preferred over all others in head-to-head races) is elected, provided there is one.[2][3][4]
A voting method with 100% efficiency would always pick the Condorcet winner, when one exists, and a method that never chose the Condorcet winner would have 0% efficiency.
Efficiency is not only affected by the voting method, but is a function of the number of voters, number of candidates, and of any strategies used by the voters.[1]
It was initially developed in 1984 by Samuel Merrill III, along with social utility efficiency.[1]
A related, generalized measure is Smith efficiency, which measures how often a voting method elects a candidate in the Smith set.[citation needed] Smith efficiency can be used to differentiate between voting methods across all elections, because unlike the Condorcet winner, the Smith set always exists. A 100% Smith-efficient method is guaranteed to be 100% Condorcet-efficient, and likewise with 0%.
See also
[edit]References
[edit]- ^ a b c d Merrill, Samuel (1984). "A Comparison of Efficiency of Multicandidate Electoral Systems". American Journal of Political Science. 28 (1): 23–48. doi:10.2307/2110786. ISSN 0092-5853. JSTOR 2110786.
- ^ Gehrlein, William V.; Valognes, Fabrice (2001-01-01). "Condorcet efficiency: A preference for indifference". Social Choice and Welfare. 18 (1): 193–205. doi:10.1007/s003550000071. ISSN 1432-217X. S2CID 10493112.
- ^ Merrill, Samuel (1985). "A statistical model for Condorcet efficiency based on simulation under spatial model assumptions". Public Choice. 47 (2): 389–403. doi:10.1007/BF00127534. ISSN 0048-5829. S2CID 153922166.
- ^ Gehrlein, William V. (2011). Voting paradoxes and group coherence : the condorcet efficiency of voting rules. Lepelley, Dominique. Berlin: Springer. ISBN 978-3-642-03107-6. OCLC 695387286.
 | This election-related article is a stub. You can help Wikipedia by expanding it. |