On domains that admit well-behaved strategy-proof social choice functions
In this paper, we investigate domains that admit “well-behaved” strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function, must be semi-single-peaked. Conversely every semi-single-peaked domain admits an anonymous, tops-only, unanimous and strategy-proof social choice function. Semi-single-peaked domains are generalizations of single-peaked domains on a tree introduced by Demange (1982) .
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Schummer, James & Vohra, Rakesh V., 2002.
"Strategy-proof Location on a Network,"
Journal of Economic Theory,
Elsevier, vol. 104(2), pages 405-428, June.
- Saporiti, Alejandro, 2009.
"Strategy-proofness and single-crossing,"
Econometric Society, vol. 4(2), June.
- Alejandro Saporiti, 2007. "Strategy-Proofness and Single-Crossing," Wallis Working Papers WP48, University of Rochester - Wallis Institute of Political Economy.
- Alejandro Saporiti, 2008. "Strategy-Proofness and Single-Crossing," Wallis Working Papers WP55, University of Rochester - Wallis Institute of Political Economy.
- Barbera Salvador & Gul Faruk & Stacchetti Ennio, 1993.
"Generalized Median Voter Schemes and Committees,"
Journal of Economic Theory,
Elsevier, vol. 61(2), pages 262-289, December.
- Barbera, S. & Sonnenschein, H., 1988.
"Voting By Quota And Committee,"
UFAE and IAE Working Papers
95-88, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Navin Aswal & Shurojit Chatterji & Arunava Sen, 2003.
Springer, vol. 22(1), pages 45-62, 08.
- Danilov, Vladimir I., 1994. "The structure of non-manipulable social choice rules on a tree," Mathematical Social Sciences, Elsevier, vol. 27(2), pages 123-131, April.
- Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990.
"Voting by Committees,"
Cowles Foundation Discussion Papers
941, Cowles Foundation for Research in Economics, Yale University.
- Shurojit Chatterji & Arunava Sen, 2009.
06-2009, Singapore Management University, School of Economics.
- Nehring, Klaus & Puppe, Clemens, 2007. "Efficient and strategy-proof voting rules: A characterization," Games and Economic Behavior, Elsevier, vol. 59(1), pages 132-153, April.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- Berga, D & Serizawa, S, 1996.
"Maximal Domain for Strategy-Proof Rules with one Public Good,"
UFAE and IAE Working Papers
353.96, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Berga, Dolors & Serizawa, Shigehiro, 2000. "Maximal Domain for Strategy-Proof Rules with One Public Good," Journal of Economic Theory, Elsevier, vol. 90(1), pages 39-61, January.
- Michel Le Breton & Arunava Sen, 1999. "Separable Preferences, Strategyproofness, and Decomposability," Econometrica, Econometric Society, vol. 67(3), pages 605-628, May.
- Miguel Ángel Ballester & Guillaume Haeringer, 2006.
"A Characterization of Single-Peaked Preferences,"
273, Barcelona Graduate School of Economics.
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
- Alejandro Neme & Jordi MassÔ & Salvador BarberÁ, 1999. "Maximal domains of preferences preserving strategy-proofness for generalized median voter schemes," Social Choice and Welfare, Springer, vol. 16(2), pages 321-336.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
- Ching, Stephen & Serizawa, Shigehiro, 1998. "A Maximal Domain for the Existence of Strategy-Proof Rules," Journal of Economic Theory, Elsevier, vol. 78(1), pages 157-166, January.
- Muller, Eitan, 1982. "Graphs and Anonymous Social Welfare Functions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 23(3), pages 609-22, October.
- Demange, Gabrielle, 1982. "Single-peaked orders on a tree," Mathematical Social Sciences, Elsevier, vol. 3(4), pages 389-396, December.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:148:y:2013:i:3:p:1050-1073. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.