Social Choice and Welfare

, Volume 40, Issue 2, pp 329–352 | Cite as

Scoring rule voting games and dominance solvability

  • Lucia Buenrostro
  • Amrita DhillonEmail author
  • Peter Vida


This article studies the dominance solvability (by iterated deletion of weakly dominated strategies) of general scoring rule voting games when there are three alternatives. The scoring rules we study include Plurality rule, Approval voting, Borda rule, and Relative Utilitarianism. We provide sufficient conditions for dominance solvability of general scoring rule voting games. The sufficient conditions that we provide for dominance solvability are in terms of one statistic of the game: sufficient agreement on the best alternative or on the worst alternative. We also show that the solutions coincide with the set of Condorcet Winners whenever the sufficient conditions for dominance solvability are satisfied. Approval Voting performs the best in terms of our criteria.


Pure Strategy Condorcet Winner Approval Vote Vote Game Plurality Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Battigalli P, Siniscalchi M (1999) Heirarchies of conditional beliefs and interactive epistemology in dynamic games. J Econ Theory 88: 188–230CrossRefGoogle Scholar
  2. Brandenburger A, Friedenberg A, Keisler HJ (2008) Admissibility in games. Econometrica 76: 307–352Google Scholar
  3. Brandenburger A, Keisler HJ (2001) Epistemic conditions for iterated admissibility, in theoretical aspects of rationality and knowledge. In: Johan van Benthem (ed) Proceedings of the eighth conference. Morgan Kaufmann, San Francisco, pp 31–37Google Scholar
  4. Brams SJ, Fishburn P (1978) Approval Voting. Am Political Sci Rev 72(3): 831–847CrossRefGoogle Scholar
  5. Brams SJ, Fishburn P (2005) Going from theory to practice: the mixed success of approval voting. Soc Choice Welf 25: 457–474CrossRefGoogle Scholar
  6. Dasgupta P, Maskin E (2004) The fairest vote of them all. Sci Am 290: 92–97CrossRefGoogle Scholar
  7. Dekel E, Fudenberg D (1990) Rational behavior with payoff uncertainty. J Econ Theory 52: 243–267CrossRefGoogle Scholar
  8. Dhillon A, Lockwood B (2004) When are plurality rule voting games dominance-solvable?. Games Econ Behav 46(1): 55–75CrossRefGoogle Scholar
  9. Dhillon A, Mertens JF (1999) Relative utilitarianism. Econometrica 67(3): 519–535CrossRefGoogle Scholar
  10. Ewerhart C (2002) Ex-ante justifiable behavior common knowledge and iterated admissibility, mimeoGoogle Scholar
  11. Farquharson R (1969) Theory of voting. Yale University Press, New HavenGoogle Scholar
  12. Gehrlein W (1983) Condorcet’s paradox. Theory Decis 15: 161–197CrossRefGoogle Scholar
  13. Gilli M (2002) Iterated admissibility as solution concept in game theory, Working Paper, Department of Economics, University of Milan, BicoccaGoogle Scholar
  14. Gretlein RJ (1983) Dominance elimination procedures on finite alternative games. Int J Game Theory 12: 107–113CrossRefGoogle Scholar
  15. Marx L (1999) Adaptive learning and iterated weak dominance. Games Econ Behav 26: 253–278CrossRefGoogle Scholar
  16. Marx L, Swinkels J (1997) Order independence for iterated weak dominance. Games Econ Behav 18: 219–245CrossRefGoogle Scholar
  17. Marx L, Swinkels J (2000) Corrigendum, order independence for iterated weak dominance. Games Econ Behav 31: 324–329CrossRefGoogle Scholar
  18. Moulin H (1979) Dominance solvable voting schemes. Econometrica 47:1137–1151Google Scholar
  19. Myerson R (1999) Theoretical comparison of electoral systems. Eur Econ Rev 43: 671–697CrossRefGoogle Scholar
  20. Myerson R (2002) Comparison of scoring rules in poisson voting games. J Econ Theory 103: 219–251CrossRefGoogle Scholar
  21. Myerson R, Weber R (1993) A theory of voting equilibria. Am Political Sci Rev 87: 102–114CrossRefGoogle Scholar
  22. Rajan U (1998) Trembles in the Bayesian foundations of solution concepts in games. J Econ Theory 82: 248–266CrossRefGoogle Scholar
  23. Samuelson L (1992) Dominated strategies and common knowledge. Games Econ Behav 4: 284–313CrossRefGoogle Scholar
  24. Stahl Dale O (1995) Lexicographic rationalizability and iterated admissibility. Econ Lett 47: 155–159CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Commerzbank SecuritiesLondonUK
  2. 2.Department of EconomicsUniversity of WarwickCoventryUK
  3. 3.University of ViennaViennaAustria

Personalised recommendations