Social Choice and Welfare

, Volume 48, Issue 3, pp 679–701 | Cite as

Strategy-proofness of the randomized Condorcet voting system

Original Paper

Abstract

In this paper, we study the strategy-proofness properties of the randomized Condorcet voting system (RCVS). Discovered at several occasions independently, the RCVS is arguably the natural extension of the Condorcet method to cases where a deterministic Condorcet winner does not exists. Indeed, it selects the always-existing and essentially unique Condorcet winner of lotteries over alternatives. Our main result is that, in a certain class of voting systems based on pairwise comparisons of alternatives, the RCVS is the only one to be Condorcet-proof. By Condorcet-proof, we mean that, when a Condorcet winner exists, it must be selected and no voter has incentives to misreport his preferences. We also prove two theorems about group-strategy-proofness. On one hand, we prove that there is no group-strategy-proof voting system that always selects existing Condorcet winners. On the other hand, we prove that, when preferences have a one-dimensional structure, the RCVS is group-strategy-proof.

Keywords

Vote System Median Voter Condorcet Winner Social Choice Theory Social Choice Rule 

Notes

Acknowledgements

I am greatly grateful to Rémi Peyre without whom this paper would not have been possible. He introduced me to social choice theory in popularized articles Peyre (2012b, 2012a, c). Second, he sketched the proof of Theorem 2, and hinted at Theorem 3. Finally, and most importantly, our discussions gave me great insights into the wonderful theory of voting systems. I am also grateful to anonymous referees as well as the managing editor, who provided useful references and remarks that greatly simplified and clarified the exposition of this work.

References

  1. Arrow K (1951) Individual values and social choice, vol 24. Wiley, Nueva YorkGoogle Scholar
  2. Aziz H, Brandt F, Brill M (2013) On the tradeoff between economic efficiency and strategy proofness in randomized social choice. In: Proceedings of the 2013 International Conference on autonomous agents and multi-agent systems, pp 455–462Google Scholar
  3. Aziz H, Brandl F, Brandt F (2014) On the incompatibility of efficiency and strategyproofness in randomized social choice. In: Proceedings of 28th Association for the advancement of artificial intelligence conference, pp 545–551Google Scholar
  4. Aziz H, Brandl F, Brandt F (2015) Universal pareto dominance and welfare for plausible utility functions. J Math Econ 60:123–133CrossRefGoogle Scholar
  5. Balbuzanov I (2016) Convex strategyproofness with an application to the probabilistic serial mechanism. Soc Choice and Welf 46(3):511–520CrossRefGoogle Scholar
  6. Black D (1958) The theory of committees and elections. Cambridge University Press, CambridgeGoogle Scholar
  7. Bogomolnaia A, Moulin H (2001) A new solution to the random assignment problem. J Econ Theory 100(2):295–328CrossRefGoogle Scholar
  8. Bogomolnaia A, Moulin H, Stong R (2005) Collective choice under dichotomous preferences. J Econ Theory 122(2):165–184CrossRefGoogle Scholar
  9. Brandl F, Brandt F, Geist C (2016a) Proving the incompatibility of efficiency and strate- gyproofness via smt solving. In: Proceedings of the 25th International joint conference on artificial intelligence (IJCAI), AAAI Press, pp 116–122Google Scholar
  10. Brandl F, Brandt F, Seedig HG (2016b) Consistent probabilistic social choice. Econometrica 84(4):1839–1880Google Scholar
  11. Campbell DE, Kelly JS (1998) Incompatibility of strategy-proofness and the condorcet principle. Soc Choice Welf 15(4):583–592CrossRefGoogle Scholar
  12. Chatterji S, Sen A, Zeng H (2014) Random dictatorship domains. Games Econ Behav 86:212–236CrossRefGoogle Scholar
  13. Condorcet MJANdC (1785) Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix. L’Imprimerie RoyaleGoogle Scholar
  14. Dummett M, Farquharson R (1961) Stability in voting. Econom: J Econom Soc 29(1): 33–43Google Scholar
  15. Ehlers L, Peters H, Storcken T (2002) Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences. J Econ Theory 105(2):408–434CrossRefGoogle Scholar
  16. Felsenthal DS, Machover M (1992) After two centuries, should Condorcet’s voting procedure be implemented? Behav Sci 37(4):250–274CrossRefGoogle Scholar
  17. Fishburn PC (1982) Nontransitive measurable utility. J Math Psychol 26(1):31–67CrossRefGoogle Scholar
  18. Fishburn PC (1984) Probabilistic social choice based on simple voting comparisons. Rev Econ Stud 51(4):683–692CrossRefGoogle Scholar
  19. Fisher DC, Ryan J (1992) Optimal strategies for a generalized “scissors, paper, and stone” game. Am Math Mon 99(10):935–942CrossRefGoogle Scholar
  20. Gans JS, Smart M (1996) Majority voting with single-crossing preferences. J Public Econ 59(2):219–237CrossRefGoogle Scholar
  21. Gibbard A (1973) Manipulation of voting schemes: a general result. Econom: J Econom Soc 41(4):587–601Google Scholar
  22. Gibbard A (1977) Manipulation of schemes that mix voting with chance. Econom: J Econom Soc 42(3):665–681Google Scholar
  23. Gibbard A (1978) Straightforwardness of game forms with lotteries as outcomes. Econom: J Econom Soc:595–614Google Scholar
  24. Grime J (2010) Non-transitive dice. http://singingbanana.com/dice/article.htm. Accessed 2 Feb 2017
  25. Kreweras G (1965) Aggregation of preference orderings. In: Mathematics and social sciences I: Proceedings of the seminars of Menthon-Saint-Bernard, France (1–27 Jul 1960) and of Gösing, Austria (3–27 Jul 1962), pp 73–79Google Scholar
  26. Laffond G, Laslier JF, Le Breton M (1993) The bipartisan set of a tournament game. Games Econ Behav 5(1):182–201CrossRefGoogle Scholar
  27. Laslier JF (1997) Tournament solutions and majority voting, vol 7. Springer, BerlinGoogle Scholar
  28. Laslier JF (2000) Aggregation of preferences with a variable set of alternatives. Soc Choice Welf 17(2):269–282CrossRefGoogle Scholar
  29. Moulin H (1980) On strategy-proofness and single peakedness. Public Choice 35(4):437–455CrossRefGoogle Scholar
  30. Myerson RB (1996) Fundamentals of social choice theory. Center for Mathematical Studies in Economics and Management Science, Northwestern University. http://home.uchicago.edu/rmyerson/research/schch1.pdf. Accessed 10 Feb 2017
  31. Nash J (1951) Non-cooperative games. Ann Math:286–295Google Scholar
  32. Penn EM, Patty JW, Gailmard S (2011) Manipulation and single-peakedness: a general result. Am J Political Sci 55(2):436–449CrossRefGoogle Scholar
  33. Peyre R (2012a) Et le vainqueur du second tour est... Images des Mathématiques, CNRS. http://images.math.cnrs.fr/Et-le-vainqueur-du-second-tour-est.html. Accessed 2 Feb 2017
  34. Peyre R (2012b) La démocratie, objet détude mathématique. Images des Mathématiques, CNRS. http://images.math.cnrs.fr/La-democratie-objet-d-etude.html. Accessed 2 Feb 2017
  35. Peyre R (2012c) La quête du graal électoral. Images des Mathématiques, CNRS. http://images.math.cnrs.fr/La-quete-du-Graal-electoral.html. Accessed 2 Feb 2017
  36. Rivest RL, Shen E (2010) An optimal single-winner preferential voting system based on game theory. In: Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC), Citeseer, pp 399–410Google Scholar
  37. Roberts KW (1977) Voting over income tax schedules. J Public Econ 8(3):329–340CrossRefGoogle Scholar
  38. Rothstein P (1990) Order restricted preferences and majority rule. Soc Choice Welf 7(4):331–342CrossRefGoogle Scholar
  39. Rothstein P (1991) Representative voter theorems. Public Choice 72(2–3):193–212CrossRefGoogle Scholar
  40. Saporiti A (2009) Strategy-proofness and single-crossing. Theor Econ 4(2):127–163Google Scholar
  41. Satterthwaite MA (1975) Strategy-proofness and arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10(2):187–217CrossRefGoogle Scholar
  42. Schulze M (2011) A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method. Soc Choice Welf 36(2):267–303CrossRefGoogle Scholar
  43. Von Neumann J (1928) Die zerlegung eines intervalles in abzählbar viele kongruente teilmengen. Fundam Math 11(1):230–238Google Scholar
  44. Von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, PrincetonGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.MIT, EECSCambridgeUSA

Personalised recommendations