Condorcet cycle elections with influential voting blocs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915595805523968 |
|---|---|
| author | Gendler, Gabriel |
| author_facet | Gendler, Gabriel |
| contents | A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the MIIA condition, and respects the complete anonymity of each voter, then it must be a Borda election, where each voter assigns two points to their preferred candidate, one to their second preference and none to their least preferred candidate.
We introduce a relaxed anonymity condition called ``transitive anonymity'', whereby a group $G$ acting transitively on the set of voters $V$ maintains the outcome of the SWF. Elections across multiple constituencies of equal size are common examples of elections with transitive anonymity but without full anonymity. First, we demonstrate that under this relaxed anonymity condition, non-Borda elections do exist. On the other hand, by modifying Kalai's proof of Arrow's Impossibility Theorem, which employs methods from the analysis of Boolean functions, we show that this can only occur when the number of voters is not a multiple of three, and we demonstrate that even these non-Borda elections are very close to being Borda. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_12340 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Condorcet cycle elections with influential voting blocs Gendler, Gabriel Combinatorics 06E30, 91B14 A Condorcet cycle election is an election (often called a Social Welfare Function, or SWF) between three candidates, where each voter ranks the three candidates according to a fixed cyclic order. Maskin showed that if such a SWF obeys the MIIA condition, and respects the complete anonymity of each voter, then it must be a Borda election, where each voter assigns two points to their preferred candidate, one to their second preference and none to their least preferred candidate. We introduce a relaxed anonymity condition called ``transitive anonymity'', whereby a group $G$ acting transitively on the set of voters $V$ maintains the outcome of the SWF. Elections across multiple constituencies of equal size are common examples of elections with transitive anonymity but without full anonymity. First, we demonstrate that under this relaxed anonymity condition, non-Borda elections do exist. On the other hand, by modifying Kalai's proof of Arrow's Impossibility Theorem, which employs methods from the analysis of Boolean functions, we show that this can only occur when the number of voters is not a multiple of three, and we demonstrate that even these non-Borda elections are very close to being Borda. |
| title | Condorcet cycle elections with influential voting blocs |
| topic | Combinatorics 06E30, 91B14 |
| url | https://arxiv.org/abs/2409.12340 |