IDEAS home Printed from https://ideas.repec.org/p/huj/dispap/dp649.html
   My bibliography  Save this paper

Consistent Voting Systems Revisited: Computation and Axiomatic Characterization

Author

Listed:
  • 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.

Suggested Citation

  • Bezalel Peleg, 2013. "Consistent Voting Systems Revisited: Computation and Axiomatic Characterization," Discussion Paper Series dp649, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    • Handle: RePEc:huj:dispap:dp649
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Holzman, Ron, 1986. "On strong representations of games by social choice functions," Journal of Mathematical Economics, Elsevier, vol. 15(1), pages 39-57, February.
    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. Bezalel Peleg & Hans Peters, 2010. "Consistent voting systems with a continuum of voters," Studies in Choice and Welfare, in: Strategic Social Choice, chapter 0, pages 123-145, Springer.
    4. 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.
    5. 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.
    6. Dutta, Bhaskar & Pattanaik, Prasanta K, 1978. "On Nicely Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 163-170, January.
    7. HOLZMAN, Ron, 1986. "On strong representations of games by social choice functions," LIDAM Reprints CORE 691, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Peleg, Bezalel, 1978. "Consistent Voting Systems," Econometrica, Econometric Society, vol. 46(1), pages 153-161, January.
    9. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Peleg, Bezalel & Peters, Hans, 2017. "Choosing k from m: Feasible elimination procedures reconsidered," Games and Economic Behavior, Elsevier, vol. 103(C), pages 254-261.
    2. Bezalel Peleg & Ron Holzman, 2017. "Representations of Political Power Structures by Strategically Stable Game Forms: A Survey," Games, MDPI, vol. 8(4), pages 1-17, October.
    3. Dominique Lepelley & Boniface Mbih, 1997. "Strategic Manipulation in Committees Using the Plurality Rule: Alternative Concepts and Frequency Calculations," Group Decision and Negotiation, Springer, vol. 6(2), pages 119-138, March.
    4. Jain, Satish, 2020. "The Strong Consistency of Neutral and Monotonic Binary Social Decision Rules," MPRA Paper 109657, University Library of Munich, Germany.
    5. Keiding, Hans & Peleg, Bezalel, 2001. "Stable voting procedures for committees in economic environments," Journal of Mathematical Economics, Elsevier, vol. 36(2), pages 117-140, November.
    6. Manimay Sen, 1984. "Strategy-proofness of a class of Borda rules," Public Choice, Springer, vol. 43(3), pages 251-285, January.
    7. Peleg, Bezalel & Peters, Hans, 2017. "Feasible elimination procedures in social choice: An axiomatic characterization," Research in Economics, Elsevier, vol. 71(1), pages 43-50.
    8. Dindar, Hayrullah & Lainé, Jean, 2017. "Manipulation of single-winner large elections by vote pairing," Economics Letters, Elsevier, vol. 161(C), pages 105-107.
    9. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    10. Bezalel Peleg & Hans Peters, 2010. "Consistent voting systems with a continuum of voters," Studies in Choice and Welfare, in: Strategic Social Choice, chapter 0, pages 123-145, Springer.
    11. Ning Neil Yu, 2013. "A one-shot proof of Arrow’s theorem and the Gibbard–Satterthwaite theorem," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(2), pages 145-149, November.
    12. Hiroki Saitoh, 2022. "Characterization of tie-breaking plurality rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(1), pages 139-173, July.
    13. Michel Breton & Vera Zaporozhets, 2009. "On the equivalence of coalitional and individual strategy-proofness properties," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(2), pages 287-309, August.
    14. Nozomu Muto & Shin Sato, 2016. "A decomposition of strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(2), pages 277-294, August.
    15. Cato, Susumu, 2011. "Maskin monotonicity and infinite individuals," Economics Letters, Elsevier, vol. 110(1), pages 56-59, January.
    16. Islam, Jamal & Mohajan, Haradhan & Moolio, Pahlaj, 2010. "Methods of voting system and manipulation of voting," MPRA Paper 50854, University Library of Munich, Germany, revised 06 May 2010.
    17. Maskin, Eric & Sjostrom, Tomas, 2002. "Implementation theory," Handbook of Social Choice and Welfare,in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 5, pages 237-288 Elsevier.
    18. Miller, Michael K., 2009. "Social choice theory without Pareto: The pivotal voter approach," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 251-255, September.
    19. Corchón, Luis C., 2008. "The theory of implementation : what did we learn?," UC3M Working papers. Economics we081207, Universidad Carlos III de Madrid. Departamento de Economía.
    20. Priscilla Man & Shino Takayama, 2013. "A unifying impossibility theorem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 249-271, October.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp649. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Michael Simkin (email available below). General contact details of provider: https://edirc.repec.org/data/crihuil.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.