IDEAS home Printed from https://ideas.repec.org/a/sae/miceco/v3y2015i2p120-139.html
   My bibliography  Save this article

Asymptotic Collusion-proofness of Voting Rules: The Case of Large Number of Candidates

Author

Listed:
  • Palash Dey
  • Y. Narahari

Abstract

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfies certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule is manipulable. It is well known that elections with a large number of voters are rarely manipulable under impartial culture (IC) assumption. However, the manipulability of voting rules when the number of candidates is large has hardly been addressed in the literature and our article focuses on this problem. First, we propose two properties: (i) asymptotic strategy-proofness and (ii) asymptotic collusion-proofness, with respect to new voters, which makes the two notions more relevant from the perspective of computational problem of manipulation. In addition to IC, we explore a new culture of society where all score vectors of the candidates are equally likely. This new notion has its motivation in computational social choice and we call it impartial scores culture (ISC) assumption. We study asymptotic strategy-proofness and asymptotic collusion-proofness for plurality, veto and k -approval, and Borda voting rules under IC as well as ISC assumptions. Specifically, we prove bounds for the fraction of manipulable profiles when the number of candidates is large. Our results show that the size of the coalition and the tie-breaking rule play a crucial role in determining whether or not a voting rule satisfies the above two properties.

Suggested Citation

  • Palash Dey & Y. Narahari, 2015. "Asymptotic Collusion-proofness of Voting Rules: The Case of Large Number of Candidates," Studies in Microeconomics, , vol. 3(2), pages 120-139, December.
    • Handle: RePEc:sae:miceco:v:3:y:2015:i:2:p:120-139
    DOI: 10.1177/2321022215588867
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/2321022215588867
    Download Restriction: no
    File URL: https://libkey.io/10.1177/2321022215588867?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Prasanta K. Pattanaik, 1975. "Strategic Voting Without Collusion Under Binary and Democratic Group Decision Rules," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 42(1), pages 93-103.
    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. Arkadii Slinko, 2002. "On asymptotic strategy-proofness of the plurality and the run-off rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 313-324.
    5. 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. Núñez, Matías & Pivato, Marcus, 2019. "Truth-revealing voting rules for large populations," Games and Economic Behavior, Elsevier, vol. 113(C), pages 285-305.
    2. Lirong Xia, 2022. "The Impact of a Coalition: Assessing the Likelihood of Voter Influence in Large Elections," Papers 2202.06411, arXiv.org, revised Jun 2023.
    3. Arkadii Slinko, 2002. "On Asymptotic Strategy-Proofness of Classical Social Choice Rules," Theory and Decision, Springer, vol. 52(4), pages 389-398, June.
    4. 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.
    5. 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.
    6. Yuliya A. Veselova, 2020. "Does Incomplete Information Reduce Manipulability?," Group Decision and Negotiation, Springer, vol. 29(3), pages 523-548, June.
    7. 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.
    8. Bednay, Dezső & Moskalenko, Anna & Tasnádi, Attila, 2019. "Dictatorship versus manipulability," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 72-76.
    9. 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.
    10. 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.
    11. Ivanov, A., 2022. "On the algorithms of exact estimations of manipulability of social choice rules for the case of 3 alternatives," Journal of the New Economic Association, New Economic Association, vol. 57(5), pages 14-23.
    12. Dezső Bednay & Attila Tasnádi & Sonal Yadav, 2022. "On the manipulability of a class of social choice functions: plurality kth rules," Review of Economic Design, Springer;Society for Economic Design, vol. 26(1), pages 127-148, March.
    13. Haris Aziz & Alexander Lam, 2021. "Obvious Manipulability of Voting Rules," Papers 2111.01983, arXiv.org, revised Jun 2022.
    14. Donald Campbell & Jerry Kelly, 2009. "Gains from manipulating social choice rules," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(3), pages 349-371, September.
    15. Steven Brams & Peter Fishburn & Samuel Merrill, 1988. "The responsiveness of approval voting: Comments on Saari and Van Newenhizen," Public Choice, Springer, vol. 59(2), pages 121-131, November.
    16. Yuliya Veselova, 2016. "The difference between manipulability indices in the IC and IANC models," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 609-638, March.
    17. Diss, Mostapha & Tsvelikhovskiy, Boris, 2021. "Manipulable outcomes within the class of scoring voting rules," Mathematical Social Sciences, Elsevier, vol. 111(C), pages 11-18.
    18. Pritchard, Geoffrey & Wilson, Mark C., 2009. "Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 35-57, July.
    19. James Green-Armytage, 2015. "Direct voting and proxy voting," Constitutional Political Economy, Springer, vol. 26(2), pages 190-220, June.
    20. Slinko, Arkadii, 2004. "How large should a coalition be to manipulate an election?," Mathematical Social Sciences, Elsevier, vol. 47(3), pages 289-293, May.

    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:sae:miceco:v:3:y:2015:i:2:p:120-139. 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: SAGE Publications (email available below). General contact details of provider: .

    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.