Instant Runoff Voting and the Reinforcement Paradox
Pith reviewed 2026-05-23 05:19 UTC · model grok-4.3
The pith
In three-candidate IRV, a losing candidate can win both halves when ballots are partitioned into two groups.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For three-candidate IRV elections we provide necessary and sufficient conditions under which there exists a partition of the ballot set into two sets of ballots such that a given losing candidate wins each of the sub-elections. Applying these conditions, we use Monte Carlo simulations to estimate the frequency with which such partitions exist under various models of voter behavior. We also analyze the frequency with which the paradox occurs in a large dataset of real-world ranked-choice elections to provide empirical probabilities. Our general finding is that IRV is highly susceptible to this paradox in three-candidate elections.
What carries the argument
Necessary and sufficient conditions on ballot sets that allow a losing candidate under full IRV to win each of two partitioned sub-elections.
If this is right
- IRV is highly susceptible to the reinforcement paradox in three-candidate elections.
- Such partitions occur at high rates under the tested models of voter behavior.
- Real-world ranked-choice election data produces occurrence rates consistent with the simulations.
Where Pith is reading between the lines
- The result implies that election administrators may need to consider how ballots are grouped or aggregated when using IRV.
- The partition conditions could be applied to test whether other ranked voting rules exhibit similar sensitivities.
- Future work might check whether the same conditions appear in elections with more than three candidates.
Load-bearing premise
The various models of voter behavior used in the Monte Carlo simulations are representative of real voter preferences in three-candidate elections.
What would settle it
A study of many three-candidate IRV elections that finds no ballot partitions allowing any loser to win both sub-elections would show the claimed susceptibility does not hold.
Figures
read the original abstract
We analyze the susceptibility of instant runoff voting (IRV) to a lesser-studied paradox known as a \emph{reinforcement paradox}, which occurs when candidate $X$ wins under IRV in two distinct elections but $X$ loses in the combined election formed by merging the ballots from the two elections. For three-candidate IRV elections we provide necessary and sufficient conditions under which there exists a partition of the ballot set into two sets of ballots such that a given losing candidate wins each of the sub-elections. Applying these conditions, we use Monte Carlo simulations to estimate the frequency with which such partitions exist under various models of voter behavior. We also analyze the frequency with which the paradox occurs in a large dataset of real-world ranked-choice elections to provide empirical probabilities. Our general finding is that IRV is highly susceptible to this paradox in three-candidate elections.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript derives necessary and sufficient conditions for the existence of reinforcement-paradox partitions in three-candidate instant-runoff-voting (IRV) elections. It then estimates the frequency of such partitions via Monte Carlo simulation under multiple voter-preference models and via direct enumeration on a large real-world ranked-choice dataset, concluding that IRV is highly susceptible to the paradox in three-candidate elections.
Significance. The combination of exact mathematical conditions, controlled variation across several preference models, and empirical frequencies from real ballots supplies a multi-pronged assessment that does not rest on any single modeling choice. If the derived conditions and reported frequencies are accurate, the work materially advances the quantitative understanding of IRV pathologies and supplies concrete, testable predictions for election data.
minor comments (3)
- [Monte Carlo simulations] The Monte Carlo section should explicitly list the simulation parameters (number of voters per election, exact preference-generation procedures for each model, number of trials) so that the reported frequencies can be reproduced.
- [Empirical analysis] The real-data analysis should state the size of the dataset, the source election jurisdictions, and the precise criterion used to identify a reinforcement-paradox partition in the observed ballots.
- [Theoretical conditions] Notation for ballot types and the partition sets should be introduced once and used consistently; a small table summarizing the notation would improve readability.
Simulated Author's Rebuttal
We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. The referee's description of the manuscript's contributions is accurate.
Circularity Check
No significant circularity
full rationale
The paper first derives necessary and sufficient conditions for reinforcement-paradox partitions in three-candidate IRV elections using standard ballot-counting logic; these conditions are stated as independent mathematical statements rather than being fitted or defined in terms of the target frequencies. It then applies the conditions in Monte Carlo simulations under multiple external voter models and in direct enumeration on a large real-world ranked-choice dataset. No parameter is fitted to a subset and then relabeled as a prediction, no self-citation supplies a load-bearing uniqueness theorem, and no ansatz or renaming reduces the central claim to its own inputs. The derivation chain therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Voter preferences in elections can be modeled using standard probabilistic distributions for simulation purposes.
Reference graph
Works this paper leans on
-
[1]
F. Aleskerov & E. Kurbanov. (1999). Degree of manipulability of social choice procedures. In: Alkan (Ed.),Current Trends in Economics. Springer
work page 1999
-
[2]
R. Aumann & M, Maschler. (1985) Game theoretic analysis of a bankruptcy problem from the Talmud.Journal of Economic Theory36(2): 195-213.https://doi.org/10.1016/ 0022-0531(85)90102-4
work page 1985
-
[3]
M. Balinski & H. Young. (2001).Fair Representation: Meeting the Ideal of One Man, One Vote. Brookings Institution Press Washington: DC
work page 2001
-
[4]
G. Benad` e, C. Donnay, M. Duchin, and T. Weighill. (2024) Proportionality for ranked voting, in theory and practice. Preprint:https://mggg.org/PRVTP
work page 2024
- [5]
- [6]
-
[7]
G. Benade, R. Buck, M. Duchin, D. Gold & T. Weighill. (2021). Ranked Choice Voting and Proportional Representation. Available at SSRN: https://ssrn.com/abstract=3778021 orhttp: //dx.doi.org/10.2139/ssrn.3778021
- [8]
- [9]
-
[10]
C. Burnett & V. Kogan. (2015). Ballot (and voter) “exhaustion” under Instant Runoff Voting: An examination of four ranked-choice elections.Electoral Studies37: 41-49
work page 2015
-
[11]
L. Cormack. More choices, more problems? Ranked choice voting errors in New York City. American Politics Research52(3): 306-319
-
[12]
S. Courtin, B. Mbih, I. Moyouwou, & T. Senne. (2010). The reinforcement axiom under sequential positional rules.Social Choice and Welfare35: 473-500
work page 2010
-
[13]
L. Diamond, E. Foley, & R. Pildes (Eds). (2025).Electoral Reform in the United States: Proposals for Combating Polarization and Extremism. Lynne Rienner Publishers, Boulder, CO
work page 2025
-
[14]
M. Dickerson, E. Martin, & D. McCune. (2024). An Empirical Analysis of the Effect of Ballot Truncation on Ranked-Choice Electoral Outcomes.The PUMP Journal of Undergraduate Research7: 79–95.https://doi.org/10.46787/pump.v7i0.3778
- [15]
-
[16]
C. Duddy. (2014). Condorcet’s principle and the strong no-show paradoxes.Theory and De- cision77: 275–285
work page 2014
-
[17]
J. Enelow & M. Hinich. (1984).The Spatial Theory of Voting: An Introduction.Cambridge University Press
work page 1984
-
[18]
J. Enelow & M. Hinich. (1990).Advances in the Spatial Theory of Voting.Cambridge Uni- versity Press
work page 1990
-
[19]
P. Favardin & D. Lepelley. (2006). Some further results on the manipulability of social choice rules.Social Choice and Welfare26: 485-509
work page 2006
-
[20]
D.S. Felsenthal. (2019). On Paradoxes Afflicting Voting Procedures: Needed Knowledge Re- garding Necessary and/or Sufficient Condition(s) for Their Occurrence. In: JF Laslier, H. Moulin, M. Sanver, & W. Zwicker (eds)The Future of Economic Design. Studies in Economic Design. Springer, Cham.https://doi.org/10.1007/978-3-030-18050-8_13
-
[21]
D.S. Felsenthal & H. Nurmi. (2019). The (In)Vulnerability of 20 Voting Procedures to the In- consistency Paradox (aka Reinforcement Paradox) in a Restricted Domain. In:Voting Procedures Under a Restricted Domain. SpringerBriefs in Economics. Springer, Cham
work page 2019
-
[22]
P. Fishburn and S. Brams. (1983). Paradoxes of preferential voting.Mathematics Magazine, 56(4): 207-214.https://doi.org/10.2307/2689808
-
[23]
A. Graham-Squire & N. Zayatz. (2020). Lack of Monotonicity Anomalies in Empirical Data of Instant-runoff Elections.Representation57(4): 565–573.https://doi.org/10.1080/00344893. 2020.1785536
-
[24]
A. Graham-Squire. (2024). Conditions for Fairness Anomalies in Instant-Runoff Voting. In M. Jones, D. McCune, J. Wilson (Eds),Mathematical Analyses of Decisions, Voting and Games. Contemporary Mathematics, Volume 795. American Mathematical Society
work page 2024
-
[25]
A. Graham-Squire and D. McCune. (2023). An Examination of Ranked-Choice Voting in the United States, 2004-2022.Representation,https://doi.org/10.1080/00344893.2023.2221689
-
[26]
J. Green-Armytage, T. Tideman, & Rafael Cosman. (2016). Statistical evaluation of voting rules.Social Choice and Welfare46(1): 183-212
work page 2016
- [27]
-
[28]
J. Kelly. (1993). Almost all social choice rules are highly manipulable, but few aren’t.Social Choice and Welfare20(3): 477-494
work page 1993
-
[29]
D.M. Kilgour, J.C. Gr` egoire, & A.M. Foley. (2020). The prevalence and consequences of ballot truncation in ranked-choice elections.Public Choice184: 197-218
work page 2020
- [30]
-
[31]
D. Lepelley, F. Chantreuil, & S. Berg. (1996). The likelihood of monotonicity paradoxes in run-off elections.Mathematical Social Sciences31(3): 133-146
work page 1996
-
[32]
D. Lepelley & V. Merlin. (2001). Scoring runoff paradoxes for variable electorates.Economic Theory14(1): 53-80
work page 2001
-
[33]
N. Mattei & T. Walsh. (2013). Preflib: A library for preferences. InADT, 259–270. Springer
work page 2013
-
[34]
D. McCune & A. Graham-Squire. (2024). Monotonicity anomalies in Scottish local govern- ment elections.Social Choice and Welfare,https://doi.org/10.1007/s00355-024-01522-5
-
[35]
D. McCune & L. McCune. (2023). The Curious Case of the 2021 Minneapolis Ward 2 City Council Election.The College Mathematics Journal: 1-5.https://doi.org/10.1080/07468342. 2023.2212548
- [36]
-
[37]
D. McCune & J. Wilson. Ranked-choice voting and the spoiler effect. (2023).Public Choice 196: 19–50.https://doi.org/10.1007/s11127-023-01050-3
-
[38]
D. McCune & J. Wilson. (2024). The Negative Participation Paradox in Three-Candidate Instant Runoff Elections.Theory and Decision98: 537-559
work page 2024
-
[39]
N. Miller. (2017). Closeness matters: monotonicity failure in IRV elections with three candi- dates.Public Choice,173: 91-108.DOI10.1007/s11127-017-0465-5
work page 2017
- [40]
-
[41]
H. Moulin. (1988). Condorcet’s principle implies the no show paradox.Journal of Economic Theory45: 53–64
work page 1988
-
[42]
H. Nurmi. (1999).Voting Paradoxes and How to Deal with Them. Springer-Verlag. IR V AND THE REINFORCEMENT PARADOX 33
work page 1999
-
[43]
J.T. Ornstein & R.Z. Norman. (2014). Frequency of monotonicity failure under instant runoff voting: estimates based on a spatial model of elections.Public Choice161:1–9
work page 2014
-
[44]
D. Otis. (2022). Single winner ranked choice voting CVRs. Online; accessed 16-July-2024. https://doi.org/10.7910/DVN/AMK8PJ, Harvard Dataverse, V13
-
[45]
S. Pettigrew & D. Radley. (2023). Ballot Marking Errors in Ranked-Choice Voting. Preprint: https://ssrn.com/abstract=4670677
work page 2023
-
[46]
J. P´ erez. (2001). No Show Paradoxes are a common flaw in Condorcet voting correspondences. Social Choice and Welfare18: 601–616
work page 2001
-
[47]
F. Plassmann & T.N. Tideman. (2014). How frequently do different voting rules encounter voting paradoxes in three-candidate elections?.Social Choice and Welfare42: 31-75
work page 2014
- [48]
-
[49]
Poundstone.Gaming the Vote: Why Elections Aren’t Fair (and What We Can Do About It)
W. Poundstone.Gaming the Vote: Why Elections Aren’t Fair (and What We Can Do About It). (2008). Hill and Wang, First Edition
work page 2008
-
[50]
M. Regenwetter, A. Kantor, A. Kim, & M. Ho. (2007). The unexpected empirical consensus among consensus methods.Psychological Science,18(7), 629–635
work page 2007
- [51]
-
[52]
D. Saari. (1995).Basic Geometry of Voting. Springer
work page 1995
-
[53]
C.G. Song. (2023). What difference does a voting rule make?.Constitutional Political Econ- omy34: 275–285.https://doi.org/10.1007/s10602-022-09375-9
-
[54]
N. Stephanopoulos. (2024). Finding Condorcet. Forthcoming inWashington and Lee Law Review
work page 2024
-
[55]
W. Thomson. (2011). Consistency and its converse: an introduction.Rev. Econ. Design15: 257–291.doi10.1007/s10058-011-0109-z
work page 2011
-
[56]
K. Tomlinson, J. Ugander, & J. Kleinberg. (2022). Ballot Length in Instant Runoff Voting. Preprint:https://arxiv.org/pdf/2207.08958.pdf
-
[57]
H.P. Young. (1974). An axiomatization of Borda’s rule.Journal of Economic Theory9: 43–52
work page 1974
-
[58]
H.P. Young. (1975). Social Choice Scoring Functions.SIAM Journal on Applied Mathematics, 28(4): 824-838. David McCune, Department of Mathematics and Data Science, William Jewell Col- lege, 500 College Hill, Liberty, MO, 64068 Email address:mccuned@william.jewell.edu Jennifer Wilson, The New School, Department of Natural Sciences and Mathemat- ics, 66 West...
work page 1975
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.