Consistent Voting Systems Revisited: Computation and Axiomatic Characterization
AbstractWe add two results to the theory of consistent voting. Let M be the set of all survivors of some feasible elimination procedure. We prove that i) M can be computed in polynomial time for each profile of preferences and ii) M is characterized by anonymity, non- imposition, Maskin monotonicity, and additive blocking.
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 The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp649.
Length: 7 pages
Date of creation: Oct 2013
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-11-29 (All new papers)
- NEP-CDM-2013-11-29 (Collective Decision-Making)
- NEP-POL-2013-11-29 (Positive Political Economics)
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.:
- Bezalel Peleg & Hans Peters, 2006.
"Consistent voting systems with a continuum of voters,"
Social Choice and Welfare,
Springer, vol. 27(3), pages 493-493, December.
- B Pezaleleleg & Hans Peters, 2006. "Consistent Voting Systems with a Continuum of Voters," Social Choice and Welfare, Springer, vol. 27(3), pages 477-492, December.
- Bezalel Peleg & Hans Peters, 2002. "Consistent voting systems with a continuum of voters," Discussion Paper Series dp308, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Peters,Hans & Peleg,Bezalel, 2002. "Consistent Voting Systems with a Continuum of Voters," Research Memorandum 024, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Oren, Ishai, 1981. "The structure of exactly strongly consistent social choice functions," Journal of Mathematical Economics, Elsevier, vol. 8(3), pages 207-220, October.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- Peleg, Bezalel, 1978. "Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 153-61, January.
- 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.
- Holzman, Ron, 1986. "On strong representations of games by social choice functions," Journal of Mathematical Economics, Elsevier, vol. 15(1), pages 39-57, February.
- Dutta, Bhaskar & Pattanaik, Prasanta K, 1978. "On Nicely Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 163-70, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).
If references are entirely missing, you can add them using this form.