Asymptotic Collusion-Proofness of Voting Rules: The Case of Large Number of Candidates
Palash Dey, Y. Narahari

TL;DR
This paper investigates how the likelihood of manipulation in voting rules diminishes as the number of candidates grows, introducing asymptotic notions of strategy-proofness and collusion-proofness under different cultural assumptions.
Contribution
It introduces asymptotic strategy-proofness and collusion-proofness concepts and analyzes their behavior for various voting rules under IC and ISC assumptions with many candidates.
Findings
Manipulability bounds decrease as candidates increase under certain conditions.
Tie-breaking rules significantly influence the robustness of voting rules.
Coalition size impacts the likelihood of successful manipulation.
Abstract
Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy 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 paper focuses on this problem. First, we propose two properties (1) asymptotic strategy-proofness and (2) 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Auction Theory and Applications · Internet Traffic Analysis and Secure E-voting
