Advanced Search
MyIDEAS: Login

Consistent Voting Systems Revisited: Computation and Axiomatic Characterization

Contents:

Author Info

  • Bezalel Peleg

Abstract

We 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 Info

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.
File URL: http://ratio.huji.ac.il/sites/default/files/publications/dp649.pdf
Download Restriction: no

Bibliographic Info

Paper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp649.

as in new window
Length: 7 pages
Date of creation: Oct 2013
Date of revision:
Handle: RePEc:huj:dispap:dp649

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. 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.
  2. Oren, Ishai, 1981. "The structure of exactly strongly consistent social choice functions," Journal of Mathematical Economics, Elsevier, vol. 8(3), pages 207-220, October.
  3. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
  4. Peleg, Bezalel, 1978. "Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 153-61, January.
  5. 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.
  6. Holzman, Ron, 1986. "On strong representations of games by social choice functions," Journal of Mathematical Economics, Elsevier, vol. 15(1), pages 39-57, February.
  7. Dutta, Bhaskar & Pattanaik, Prasanta K, 1978. "On Nicely Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 163-70, January.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp649. 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: (Ilan Nehama).

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.