Nash implementable domains for the Borda count
We characterize the preference domains on which the Borda count satisfies Maskin monotonicity. The basic concept is the notion of a "cyclic permutation domain" which arises by fixing one particular ordering of alternatives and including all its cyclic permutations. The cyclic permutation domains are exactly the maximal domains on which the Borda count is strategy-proof (when combined with every tie breaking rule). It turns out that the Borda count is monotonic on a larger class of domains. We show that the maximal domains on which the Borda count satisfies Maskin monotonicity are the "cyclically nested permutation domains." These are the preference domains which can be obtained from the cyclic permutation domains in an appropriate recursive way.
|Date of creation:||07 Nov 2006|
|Contact details of provider:|| Postal: Ludwigstraße 33, D-80539 Munich, Germany|
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
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.:
- Kalai, Ehud & Ritz, Zvi, 1980.
"Characterization of the private alternatives domains admitting arrow social welfare functions,"
Journal of Economic Theory,
Elsevier, vol. 22(1), pages 23-36, February.
- Ehud Kalai & Zvi Ritz, 1978. "Characterization of the Private Alternative Domains Admitting Arrow Social Welfare Functions," Discussion Papers 341, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gaertner,Wulf, 2006. "Domain Conditions in Social Choice Theory," Cambridge Books, Cambridge University Press, number 9780521028745, Diciembre.
- Gaertner,Wulf, 2001. "Domain Conditions in Social Choice Theory," Cambridge Books, Cambridge University Press, number 9780521791021, Diciembre.
- Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
- Eric Maskin, 1998. "Nash Equilibrium and Welfare Optimality," Harvard Institute of Economic Research Working Papers 1829, Harvard - Institute of Economic Research.
- Muller, Eitan & Satterthwaite, Mark A., 1977. "The equivalence of strong positive association and strategy-proofness," Journal of Economic Theory, Elsevier, vol. 14(2), pages 412-418, April.
- Martin Barbie & Clemens Puppe & Attila Tasnádi, 2006. "Non-manipulable domains for the Borda count," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(2), pages 411-430, January.
- Martin Barbie & Clemens Puppe & Attila Tasnadi, 2003. "Non-Manipulable Domains for the Borda Count," Bonn Econ Discussion Papers bgse13_2003, University of Bonn, Germany.
- M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 461-471, June.
- Orhan Erdem & M. Sanver, 2005. "Minimal monotonic extensions of scoring rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 25(1), pages 31-42, October.
- Kalai, Ehud & Muller, Eitan, 1977. "Characterization of domains admitting nondictatorial social welfare functions and nonmanipulable voting procedures," Journal of Economic Theory, Elsevier, vol. 16(2), pages 457-469, December.
- Ehud Kalai & Eitan Muller, 1977. "Characterization of Domains Admitting Nondictatorial Social Welfare Functions and Nonmanipulable Voting Procedures," Discussion Papers 234, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:775. 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: (Joachim Winter)
If references are entirely missing, you can add them using this form.