Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.15338 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912968473575424 |
|---|---|
| author | De Santis, Emilio Di Crescenzo, Antonio Mustaro, Verdiana |
| author_facet | De Santis, Emilio Di Crescenzo, Antonio Mustaro, Verdiana |
| contents | We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$, and voters select their preferred candidate from each. Provided there are no ties, the two respective winners advance to a second round, where voters choose between them according to their initial preference lists. We analyze this scenario using a probabilistic framework based on a spatial voting model with cyclically constructed preference lists and uniformly distributed ideal points. Our objective is to determine the optimal initial partition of $A$ and $B$ that maximizes a target candidate's probability of winning. We analytically evaluate this success probability and derive its asymptotic behavior as the number of candidates $n \to \infty$. A key finding is that the asymptotically optimal relative width of the main discrete cluster converges precisely to one-fifth of the total number of candidates. Finally, we provide computational results and confidence intervals derived from simulation algorithms that validate the analytical framework. Specifically, we demonstrate that the probability of the universal victory event rapidly approaches $1$ as the electorate size increases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_15338 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Strategic Partitioning and Manipulability in Two-Round Elections De Santis, Emilio Di Crescenzo, Antonio Mustaro, Verdiana Computer Science and Game Theory Optimization and Control Probability 60F10, 91B12, 91B14, 93-10 We consider a two-round election model involving $m$ voters and $n$ candidates. Each voter is endowed with a strict preference list ranking the candidates. In the first round, the candidates are partitioned into two subsets, $A$ and $B$, and voters select their preferred candidate from each. Provided there are no ties, the two respective winners advance to a second round, where voters choose between them according to their initial preference lists. We analyze this scenario using a probabilistic framework based on a spatial voting model with cyclically constructed preference lists and uniformly distributed ideal points. Our objective is to determine the optimal initial partition of $A$ and $B$ that maximizes a target candidate's probability of winning. We analytically evaluate this success probability and derive its asymptotic behavior as the number of candidates $n \to \infty$. A key finding is that the asymptotically optimal relative width of the main discrete cluster converges precisely to one-fifth of the total number of candidates. Finally, we provide computational results and confidence intervals derived from simulation algorithms that validate the analytical framework. Specifically, we demonstrate that the probability of the universal victory event rapidly approaches $1$ as the electorate size increases. |
| title | Strategic Partitioning and Manipulability in Two-Round Elections |
| topic | Computer Science and Game Theory Optimization and Control Probability 60F10, 91B12, 91B14, 93-10 |
| url | https://arxiv.org/abs/2603.15338 |