Nash implementable domains for the Borda count
AbstractWe 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.
Download InfoIf 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.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 775.
Date of creation: 07 Nov 2006
Date of revision:
Maskin monotonicity; Borda count; restricted preference domains;
Other versions of this item:
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-11-12 (All new papers)
- NEP-CDM-2006-11-12 (Collective Decision-Making)
- NEP-GTH-2006-11-12 (Game Theory)
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.:
- Gaertner,Wulf, 2001.
"Domain Conditions in Social Choice Theory,"
Cambridge University Press, number 9780521791021, Fall.
- 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.
- Martin Barbie & Clemens Puppe & Attila Tasnádi, 2006.
"Non-manipulable domains for the Borda count,"
Springer, vol. 27(2), pages 411-430, January.
- 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.
- Eric Maskin, 1998.
"Nash Equilibrium and Welfare Optimality,"
Harvard Institute of Economic Research Working Papers
1829, Harvard - Institute of Economic Research.
- Orhan Erdem & M. Sanver, 2005. "Minimal monotonic extensions of scoring rules," Social Choice and Welfare, Springer, vol. 25(1), pages 31-42, October.
- 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.
- M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer, vol. 39(3), pages 461-471, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.