IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2111.01983.html
   My bibliography  Save this paper

Obvious Manipulability of Voting Rules

Author

Listed:
  • Haris Aziz
  • Alexander Lam

Abstract

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by Troyan and Morrill (2020). We identify several classes of voting rules that satisfy this notion. We also show that several voting rules including k-approval fail to satisfy this property. We characterize conditions under which voting rules are obviously manipulable. One of our insights is that certain rules are obviously manipulable when the number of alternatives is relatively large compared to the number of voters. In contrast to the Gibbard-Satterthwaite theorem, many of the rules we examined are not obviously manipulable. This reflects the relatively easier satisfiability of the notion and the zero information assumption of not obvious manipulability, as opposed to the perfect information assumption of strategyproofness. We also present algorithmic results for computing obvious manipulations and report on experiments.

Suggested Citation

  • Haris Aziz & Alexander Lam, 2021. "Obvious Manipulability of Voting Rules," Papers 2111.01983, arXiv.org, revised Jun 2022.
    • Handle: RePEc:arx:papers:2111.01983
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2111.01983
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Josué Ortega & Erel Segal-Halevi, 2022. "Obvious manipulations in cake-cutting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 969-988, November.
    2. Shmuel Nitzan, 1985. "The vulnerability of point-voting schemes to preference variation and strategic manipulation," Public Choice, Springer, vol. 47(2), pages 349-370, January.
    3. Arkadii Slinko & Shaun White, 2014. "Is it ever safe to vote strategically?," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(2), pages 403-427, August.
    4. Pierre Favardin & Dominique Lepelley & Jérôme Serais, 2002. "Borda rule, Copeland method and strategic manipulation," Post-Print halshs-00069522, HAL.
    5. Kenneth J. Arrow, 1950. "A Difficulty in the Concept of Social Welfare," Journal of Political Economy, University of Chicago Press, vol. 58(4), pages 328-328.
    6. Pierre Favardin & Dominique Lepelley & Jérôme Serais, 2002. "original papers : Borda rule, Copeland method and strategic manipulation," Review of Economic Design, Springer;Society for Economic Design, vol. 7(2), pages 213-228.
    7. 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.
    8. 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. James Green-Armytage & T. Tideman & Rafael Cosman, 2016. "Statistical evaluation of voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(1), pages 183-212, January.
    2. Bednay, Dezső & Moskalenko, Anna & Tasnádi, Attila, 2019. "Dictatorship versus manipulability," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 72-76.
    3. Marie-Louise Lackner & Martin Lackner, 2017. "On the likelihood of single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(4), pages 717-745, April.
    4. Diss, Mostapha & Tsvelikhovskiy, Boris, 2021. "Manipulable outcomes within the class of scoring voting rules," Mathematical Social Sciences, Elsevier, vol. 111(C), pages 11-18.
    5. Mostapha Diss, 2015. "Strategic manipulability of self-selective social choice rules," Annals of Operations Research, Springer, vol. 229(1), pages 347-376, June.
    6. Green-Armytage, James, 2011. "Strategic voting and nomination," MPRA Paper 32200, University Library of Munich, Germany.
    7. James Green-Armytage, 2014. "Strategic voting and nomination," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(1), pages 111-138, January.
    8. Krzysztof Kontek & Honorata Sosnowska, 2020. "Specific Tastes or Cliques of Jurors? How to Reduce the Level of Manipulation in Group Decisions?," Group Decision and Negotiation, Springer, vol. 29(6), pages 1057-1084, December.
    9. Moyouwou, Issofa & Tchantcho, Hugue, 2017. "Asymptotic vulnerability of positional voting rules to coalitional manipulation," Mathematical Social Sciences, Elsevier, vol. 89(C), pages 70-82.
    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. Donaldson, Jason & Piacentino, Giorgia & Malenko, Nadya, 2017. "Deadlock on the Board," CEPR Discussion Papers 12503, C.E.P.R. Discussion Papers.
    12. Freixas, Josep & Parker, Cameron, 2015. "Manipulation in games with multiple levels of output," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 144-151.
    13. António Osório, 2020. "Performance Evaluation: Subjectivity, Bias and Judgment Style in Sport," Group Decision and Negotiation, Springer, vol. 29(4), pages 655-678, August.
    14. Arribillaga, R. Pablo & Bonifacio, Agustín G., 2024. "Obvious manipulations of tops-only voting rules," Games and Economic Behavior, Elsevier, vol. 143(C), pages 12-24.
    15. Yuliya A. Veselova, 2020. "Does Incomplete Information Reduce Manipulability?," Group Decision and Negotiation, Springer, vol. 29(3), pages 523-548, June.
    16. Stensholt, Eivind, 2019. "MMP-elections and the assembly size," Discussion Papers 2019/15, Norwegian School of Economics, Department of Business and Management Science.
    17. M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 461-471, June.
    18. Dotti, Valerio, 2014. "Generalized Comparative Statics for Political Economy Models," MPRA Paper 60711, University Library of Munich, Germany.
    19. Eivind Stensholt, 2013. "What shall we do with the cyclic profile?," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(1), pages 229-262, January.
    20. António Osório, 2017. "Judgement and ranking: living with hidden bias," Annals of Operations Research, Springer, vol. 253(1), pages 501-518, June.

    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:arx:papers:2111.01983. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.