Generalized Condorcet winners
- 255 Downloads
In an election, a Condorcet winner is a candidate who would win every two-candidate subelection against any of the other candidates. In this paper, we extend the idea of a Condorcet winner to subelections consisting of three or more candidates. We then examine some of the relationships between the resulting generalized Condorect winners.
KeywordsEquivalence Class Weighting Vector Condorcet Winner Vote Procedure Element Subset
Special thanks to Melissa Banister, Martin Malandro, and Francis Su for helpful conversations, comments, and questions. Special thanks also to the editors and anonymous referee for valuable remarks and suggestions. Meyers, Wolff, and Wu were supported through the Claremont Colleges REU by the NSF Grant DMS 0755540.
- Black D (1958) The theory of committees and elections. Cambridge University Press, CambridgeGoogle Scholar
- Gehrlein WV (2006) Condorcet’s paradox. Springer, BerlinGoogle Scholar
- Saari DG (1992) Symmetry extensions of “neutrality”. I. Advantage to the Condorcet loser. Soc Choice Welf 9(4):307–336Google Scholar