Social Choice and Welfare

, Volume 52, Issue 2, pp 363–393 | Cite as

Manipulability of consular election rules

  • Egor Ianovski
  • Mark C. WilsonEmail author
Original Paper


The Gibbard–Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan–Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optimist nor a pessimist, it must have a weak dictator. However, the assumption that the function is onto with respect to singletons makes the Duggan–Schwartz theorem inapplicable to elections which necessarily select multiple winners. In this paper we make a start on this problem by considering rules which always elect exactly two winners (such as the consulship of ancient Rome). We establish that if such a consular election rule cannot be expressed as the union of two disjoint social choice functions, then strategy-proofness implies the existence of a dictator. Although we suspect that a similar result holds for k-winner rules for \(k>2\), there appear to be many obstacles to proving it, which we discuss in detail.


  1. Aswal N, Chatterji S, Sen A (2003) Dictatorial domains. Econ Theory 22(1):45–62. CrossRefGoogle Scholar
  2. Barberà S (1977) The manipulation of social choice mechanisms that do not leave “Too Much” to chance. Econometrica 45(7):1573–1588. ISSN: 00129682, 14680262.
  3. Barberà S (2011) Strategyproof social choice. In: Handbook of social choice and welfare, Vol 2, Elsevier, Amsterdam, pp 731–831Google Scholar
  4. Barberà S, Bossert W, Pattanaik PK (2004) Ranking sets of objects. Springer, New York.
  5. Barberà S, Coelho D (2008) How to choose a non-controversial list with k names. Soc Choice Welf 31:79–96CrossRefGoogle Scholar
  6. Barberà S, Coelho D (2010) On the rule of k names. Games Econ Behav 70(1):44–61CrossRefGoogle Scholar
  7. Barberá S, Massó J, Neme A (2005) Voting by committees under constraints. J Econ Theory 122(2):185–205. CrossRefGoogle Scholar
  8. Barberà S, Sonnenschein H, Zhou L (1991) Voting by committees. Econometrica 59(3):595–609. ISSN:00129682, 14680262.
  9. Campbell DE, Kelly JS (2002) A leximin characterization of strategy-proof and non-resolute social choice procedures. Econ Theory 20(4):809–829. CrossRefGoogle Scholar
  10. Duggan J, Schwartz T (1992) Strategic manipulability is inescapable: Gibbard–Satterthwaite without resoluteness. In: Working papers 817, California Institute of Technology, Division of the Humanities and Social Sciences.
  11. Duggan J, Schwartz T (2000) Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized. Soc Choice Welf 17(1):85–93. CrossRefGoogle Scholar
  12. Dummett M, Farquharson R (1961) Stability in voting. Econ J Econ Soc. pp 33–43. Accessed on 10 Apr 2016
  13. Faliszewski P et al (2016) Committee scoring rules: axiomatic classification and hierarchy. In: Proceedings of the twenty-fifth international joint conference on artificial intelligence, IJCAI’16, New York, AAAI Press, pp 250–256. ISBN: 978-1-57735-770-4.
  14. Gibbard A (1973) Manipulation of voting schemes: a general result. Econometrica 41(4):587–601.
  15. Gibbard A (1977) Manipulation of schemes that mix voting with chance. In: Econometrica 45.3, p. 665. ISSN: 00129682. Accessed on 07 Feb 2014
  16. Kelly JS (1977) Strategy-proofness and social choice functions without single valuedness. Econometrica 45(2):439–446. ISSN: 00129682, 14680262.
  17. Meir R et al (2008) Complexity of strategic behavior in multi-winner elections. J Artif Intell Res 33(1):149–178. ISSN: 1076-9757.
  18. Moulin Hervé et al (2016) Handbook of computational social choice. Cambridge University Press, CambridgeGoogle Scholar
  19. Özyurt S, Sanver MR (2008) Strategy-proof resolute social choice correspondences. Soc Choice Welf 30(1):89–101. CrossRefGoogle Scholar
  20. Özyurt S, Sanver MR (2009) A general impossibility result on strategy-proof social choice hyperfunctions. In: Games and economic behavior 66.2. Special Section In Honor of David Gale, pp 880–892. ISSN: 0899-8256.
  21. Pattanaik PK, Dutta B (1978) Strategy and group choice. Contributions to economic analysis. North-Holland Pub. Co. ISBN: 9780444851260.
  22. Reffgen A (2011) Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness. Soc Choice Welf 37(1):39–59. CrossRefGoogle Scholar
  23. 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–217. CrossRefGoogle Scholar
  24. Sertel M, Slinko A (2007) Ranking committees, income streams or multisets. Econ Theory 30(2):265–287. CrossRefGoogle Scholar
  25. Skowron P, Faliszewski P, Slinko A (2016) Axiomatic characterization of committee scoring rules. Preprint arXiv:1604.01529
  26. Taylor AD (2002) The manipulability of voting systems. In: The American Mathematical Monthly 109(4):321–337. ISSN: 00029890, 19300972.

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Higher School of EconomicsSt PetersburgRussia
  2. 2.University of AucklandAucklandNew Zealand

Personalised recommendations