International Journal of Game Theory

, Volume 43, Issue 1, pp 153–168 | Cite as

A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model

  • Kentaro Hatsumi
  • Dolors Berga
  • Shigehiro Serizawa


Following “Barberà et al. (1991, Econometrica 59:595–609)”, we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable preferences is a maximal domain for the existence of rules satisfying strategy-proofness and no-vetoer.


Social choice Mechanism design Voting by committees  Generalized median voter scheme Separable preference 

JEL Classification

C72 D71 H41 



We would like to thank Professors Barberà, Massó, Neme, and Sonnenschein for helpful discussions. We are also grateful to an associate editor, two anonymous reviewers, and participants at the 10th International Meeting of the Society for Social Choice and Welfare in Moscow, the 1st MOVE-ISER joint workshop at Universitat Autònoma de Barcelona, and a seminar at Kyoto University for helpful comments. Hatsumi and Serizawa acknowledge support from the Japan Society for the Promotion of Science through the Research Fellowship for Young Scientists 22-4996 and the Grant-in-Aid for Scientific Research 22330061, respectively. Berga acknowledges the support from the Spanish Ministry of Science and Innovation through the grants SEJ2007-60671 and ECO2010-16353, and from Generalitat de Catalunya through the grant SGR2009-0189. She also acknowledges the Research Recognition Programme of the Barcelona GSE.

Supplementary material

182_2013_378_MOESM1_ESM.pdf (115 kb)
Supplementary material 1 (PDF 116 KB)


  1. Barberà S, Sonnenschein H, Zhou L (1991) Voting by committees. Econometrica 59:595–609CrossRefGoogle Scholar
  2. Barberà S, Gul F, Stacchetti E (1993) Generalized median voter schemes and committees. J Econ Theory 61:262–289CrossRefGoogle Scholar
  3. Barberà S, Massó J, Neme A (1999) Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes. Soc Choice Welf 16:321–336CrossRefGoogle Scholar
  4. Barberà S, Massó J, Neme A (2005) Voting by committees under constraints. J Econ Theory 122:185–205CrossRefGoogle Scholar
  5. Barbie M, Puppe C, Tasnádi A (2006) Non-manipulable domains for the Borda count. Econ Theory 27:411–430Google Scholar
  6. Berga D (2002) Single-peakedness and strategy-proofness of generalized median voter schemes. Soc Choice Welf 19:175–192CrossRefGoogle Scholar
  7. Berga D, Serizawa S (2000) Maximal domain for strategy-proof rules with one public good. J Econ Theory 90:39–61CrossRefGoogle Scholar
  8. Berga D, Bergantiños G, Massó J, Neme A (2004) Stability and voting by committees with exit. Soc Choice Welf 23:229–247CrossRefGoogle Scholar
  9. Berga D, Bergantiños G, Massó J, Neme A (2006) On exiting after voting. Int J Game Theory 34:33–54CrossRefGoogle Scholar
  10. Chatterji S, Sen A (2011) Tops-only domains. Econ Theory 46:255–282CrossRefGoogle Scholar
  11. Ching S, Serizawa S (1998) A maximal domain for the existence of strategy-proof rules. J Econ Theory 78:157–166CrossRefGoogle Scholar
  12. Ehlers L (2002) Coalitional strategy-proof house allocation. J Econ Theory 105:298–317CrossRefGoogle Scholar
  13. Gibbard A (1973) Manipulation of voting schemes: a general result. Econometrica 41:587–601CrossRefGoogle Scholar
  14. Hatsumi K, Berga D, Serizawa S, (2013) A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model. ISER Discussion Paper 809, Osaka University.
  15. Ju B-G (2003) A characterization of strategy-proof voting rules for separable weak orderings. Soc Choice Welf 21:469–499CrossRefGoogle Scholar
  16. Ju B-G (2005) An efficiency characterization of plurality social choice on simple preference domains. Econ Theory 26:115–128CrossRefGoogle Scholar
  17. Maskin E (1999) Nash equilibrium and welfare optimality. Rev Econ Stud 66:23–38CrossRefGoogle Scholar
  18. Massó J, Neme A (2001) Maximal domain of preferences in the division problem. Games Econ Behav 37:367–387CrossRefGoogle Scholar
  19. Massó J, Neme A (2004) A maximal domain of preferences for strategy-proof, efficient, and simple rules in the division problem. Soc Choice Welf 23:187–206CrossRefGoogle Scholar
  20. Mizobuchi H, Serizawa S (2006) Maximal domain for strategy-proof rules in allotment economies. Soc Choice Welf 27:195–210CrossRefGoogle Scholar
  21. Nehring K, Puppe C (2007) The structure of strategy-proof social choice—part I: general characterization and possibility results on median spaces. J Econ Theory 135:269–305CrossRefGoogle Scholar
  22. Repullo R (1987) A simple proof of Maskin’s theorem on Nash implementation. Soc Choice Welf 4:39–41CrossRefGoogle Scholar
  23. Sanver MR (2009) Strategy-proofness of the plurality rule over restricted domains. Econ Theory 39:461–471CrossRefGoogle Scholar
  24. Satterthwaite MA (1975) Strategy-proofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10:187–217CrossRefGoogle Scholar
  25. Serizawa S (1995) Power of voters and domain of preferences where voting by committees is strategy-proof. J Econ Theory 67:599–608CrossRefGoogle Scholar
  26. Shimomura K-I (1996) Partially efficient voting by committees. Soc Choice Welf 13:327–342CrossRefGoogle Scholar
  27. Vorsatz M (2008) Scoring rules on dichotomous preferences. Soc Choice Welf 31:151–162CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Kentaro Hatsumi
    • 1
  • Dolors Berga
    • 2
  • Shigehiro Serizawa
    • 3
  1. 1.Faculty of Policy StudiesKansai UniversitySuitaJapan
  2. 2.Departament d’EconomiaUniversitat de GironaGironaSpain
  3. 3.Institute of Social and Economic ResearchOsaka UniversityMihogaokaJapan

Personalised recommendations