IDEAS home Printed from https://ideas.repec.org/p/cla/levrem/843644000000000039.html
   My bibliography  Save this paper

Mediators Enable Truthful Voting

Author

Listed:
  • Bezalel Peleg
  • Ariel D Procaccia

Abstract

The Gibbard-Satterthwaite Theorem asserts the impossibility of designing a non-dictatorial voting rule in which truth-telling always constitutes a Nash equilibrium. We show that in voting games of complete information where a mediator is on hand, this troubling impossibility result can be alleviated. Indeed, we characterize families of voting rules where, given a mediator, truthful preference revelation is always in strong equilibrium. In particular, we observe that the family of feasible elimination procedures has the foregoing property.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Bezalel Peleg & Ariel D Procaccia, 2007. "Mediators Enable Truthful Voting," Levine's Bibliography 843644000000000039, UCLA Department of Economics.
    • Handle: RePEc:cla:levrem:843644000000000039
    as

    Download full text from publisher

    File URL: http://ratio.huji.ac.il/dp_files/dp451.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Peleg,Bezalel, 2008. "Game Theoretic Analysis of Voting in Committees," Cambridge Books, Cambridge University Press, number 9780521074650, September.
    2. Bezalel Peleg, 1997. "Effectivity functions, game forms, games, and rights," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 15(1), pages 67-80.
    3. 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.
    4. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Peleg, Bezalel & Peters, Hans, 2017. "Feasible elimination procedures in social choice: An axiomatic characterization," Research in Economics, Elsevier, vol. 71(1), pages 43-50.
    2. Bezalel Peleg & Ariel Procaccia, 2010. "Implementation by mediated equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 191-207, March.

    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. 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.
    2. 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.
    3. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2012. "Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(4), pages 791-808, November.
    4. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    5. Bock, Hans-Hermann & Day, William H. E. & McMorris, F. R., 1998. "Consensus rules for committee elections," Mathematical Social Sciences, Elsevier, vol. 35(3), pages 219-232, May.
    6. Murat R. Sertel & M. Remzi Sanver, 2004. "Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 22(2), pages 331-347, April.
    7. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    8. John C. McCabe-Dansted & Arkadii Slinko, 2006. "Exploratory Analysis of Similarities Between Social Choice Rules," Group Decision and Negotiation, Springer, vol. 15(1), pages 77-107, January.
    9. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    10. Aleskerov, Fuad & Karabekyan, Daniel & Sanver, M. Remzi & Yakuba, Vyacheslav, 2012. "On the manipulability of voting rules: The case of 4 and 5 alternatives," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 67-73.
    11. Lirong Xia, 2020. "How Likely Are Large Elections Tied?," Papers 2011.03791, arXiv.org, revised Jul 2021.
    12. Dindar, Hayrullah & Lainé, Jean, 2017. "Manipulation of single-winner large elections by vote pairing," Economics Letters, Elsevier, vol. 161(C), pages 105-107.
    13. Barbera, S. & Bossert, W. & Pattanaik, P.K., 2001. "Ranking Sets of Objects," Cahiers de recherche 2001-02, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    14. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    15. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    16. Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
    17. Bruno Frey, 2011. "Tullock challenges: happiness, revolutions, and democracy," Public Choice, Springer, vol. 148(3), pages 269-281, September.
    18. Donaldson, Jason & Piacentino, Giorgia & Malenko, Nadya, 2017. "Deadlock on the Board," CEPR Discussion Papers 12503, C.E.P.R. Discussion Papers.
    19. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    20. Freixas, Josep & Parker, Cameron, 2015. "Manipulation in games with multiple levels of output," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 144-151.

    More about this item

    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:cla:levrem:843644000000000039. 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: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    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.