pith. sign in

arxiv: 2502.05185 · v4 · submitted 2025-01-23 · ⚛️ physics.soc-ph · cs.GT

Instant Runoff Voting and the Reinforcement Paradox

Pith reviewed 2026-05-23 05:19 UTC · model grok-4.3

classification ⚛️ physics.soc-ph cs.GT
keywords instant runoff votingreinforcement paradoxranked choice votingvoting paradoxesthree-candidate electionsmonte carlo simulationelection data analysis
0
0 comments X

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.

The paper examines the reinforcement paradox in instant runoff voting, where a candidate wins two separate elections but loses when the ballots are merged into one. For three-candidate races it derives exact conditions that determine when a ballot set can be split so a given loser wins each resulting sub-election. Monte Carlo runs then measure how often such splits arise under different voter preference models, and a dataset of actual ranked-choice elections supplies observed rates. If the conditions hold often, IRV results become sensitive to whether votes are counted together or in separate groups.

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

These are editorial extensions of the paper, not claims the author makes directly.

  • 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

Figures reproduced from arXiv: 2502.05185 by David McCune, Jennifer Wilson.

Figure 1
Figure 1. Figure 1: Visualizations of the two bimodal spatial models. model. One of the fruits of these labors is the software package Normaliz [9], which can provide limiting probabilities under IAC in three-candidate elections given a set of linear constraints. In the complete ballot case, Normaliz determines the pro￾portion of integer values of X1, X2, Y1, Y2, Z1 and Z2 that satisfy the inequalities in Proposition 1 given … view at source ↗
Figure 2
Figure 2. Figure 2: Estimated probabilities that an election demonstrates a reinforcement paradox under the model Dir(α). The top figure shows unconditioned probabilities while the bottom figure shows probabilities conditioned on the absence of a majority candidate [PITH_FULL_IMAGE:figures/full_fig_p021_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: (Top) Bootstrapping frequency results for elections that are susceptible to a reinforcement paradox. (Bottom) Boot￾strapping frequency results for elections that are are not susceptible to a reinforcement paradox but generated at least one pseudopro￾file that is. 6.1. Theoretical Versus Empirical Results. As is often the case in social choice, none of the theoretical models give probabilities which closely… view at source ↗
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.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

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)
  1. [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.
  2. [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.
  3. [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

0 responses · 0 unresolved

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

0 steps flagged

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

0 free parameters · 1 axioms · 0 invented entities

The abstract does not specify any free parameters or new entities; the main assumptions relate to standard modeling practices in the field.

axioms (1)
  • domain assumption Voter preferences in elections can be modeled using standard probabilistic distributions for simulation purposes.
    The paper applies Monte Carlo simulations under various models of voter behavior.

pith-pipeline@v0.9.0 · 5670 in / 1170 out tokens · 63773 ms · 2026-05-23T05:19:57.964906+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

58 extracted references · 58 canonical work pages

  1. [1]

    Aleskerov & E

    F. Aleskerov & E. Kurbanov. (1999). Degree of manipulability of social choice procedures. In: Alkan (Ed.),Current Trends in Economics. Springer

  2. [2]

    Aumann & M, Maschler

    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

  3. [3]

    Balinski & H

    M. Balinski & H. Young. (2001).Fair Representation: Meeting the Ideal of One Man, One Vote. Brookings Institution Press Washington: DC

  4. [4]

    Benad` e, C

    G. Benad` e, C. Donnay, M. Duchin, and T. Weighill. (2024) Proportionality for ranked voting, in theory and practice. Preprint:https://mggg.org/PRVTP

  5. [5]

    Brandt, M

    F. Brandt, M. Matth¨ aus, & C. Saile. (2022). Minimal voting paradoxes.Journal of Theoretical Politics34(4): 527-551

  6. [6]

    Bardal, M

    T. Bardal, M. Brill, D. McCune, & J. Peters. (2024). Proportional Representation in Practice: Quantifying Proportionality in Ordinal Elections. Submitted

  7. [7]

    Benade, R

    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. [8]

    Brandt, C

    F. Brandt, C. Dong, and D. Peters. (2024). Condorcet-Consistent Choice Among Three Can- didates.https://arxiv.org/abs/2411.19857

  9. [9]

    Bruns, B

    W. Bruns, B. Ichim, C. S¨ oger, & U. von der Ohe. (2022).Normaliz. Algorithms for ratio- nal cones and affine monoids.,Normaliz.https://www.normaliz.uni-osnabrueck.de. Accessed Nov. 1, 2024

  10. [10]

    exhaustion

    C. Burnett & V. Kogan. (2015). Ballot (and voter) “exhaustion” under Instant Runoff Voting: An examination of four ranked-choice elections.Electoral Studies37: 41-49

  11. [11]

    L. Cormack. More choices, more problems? Ranked choice voting errors in New York City. American Politics Research52(3): 306-319

  12. [12]

    Courtin, B

    S. Courtin, B. Mbih, I. Moyouwou, & T. Senne. (2010). The reinforcement axiom under sequential positional rules.Social Choice and Welfare35: 473-500

  13. [13]

    Diamond, E

    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

  14. [14]

    Dickerson, E

    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. [15]

    Donnay, M

    C. Donnay, M. Duchin, J. Gibson, Z. Glaser, A. Hong, M. Mukundan, & J. Wang. VoteKit: A Python pacakge for computational social choice research. Preprint. 32 DA VID MCCUNE AND JENNIFER WILSON

  16. [16]

    C. Duddy. (2014). Condorcet’s principle and the strong no-show paradoxes.Theory and De- cision77: 275–285

  17. [17]

    Enelow & M

    J. Enelow & M. Hinich. (1984).The Spatial Theory of Voting: An Introduction.Cambridge University Press

  18. [18]

    Enelow & M

    J. Enelow & M. Hinich. (1990).Advances in the Spatial Theory of Voting.Cambridge Uni- versity Press

  19. [19]

    Favardin & D

    P. Favardin & D. Lepelley. (2006). Some further results on the manipulability of social choice rules.Social Choice and Welfare26: 485-509

  20. [20]

    Felsenthal

    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. [21]

    Felsenthal & H

    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

  22. [22]

    Fishburn and S

    P. Fishburn and S. Brams. (1983). Paradoxes of preferential voting.Mathematics Magazine, 56(4): 207-214.https://doi.org/10.2307/2689808

  23. [23]

    Graham-Squire & N

    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. [24]

    Graham-Squire

    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

  25. [25]

    Graham-Squire and D

    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. [26]

    Green-Armytage, T

    J. Green-Armytage, T. Tideman, & Rafael Cosman. (2016). Statistical evaluation of voting rules.Social Choice and Welfare46(1): 183-212

  27. [27]

    Kamwa, V

    E. Kamwa, V. Merlin, & F.M. Top. (2023). Scoring Run-off Rules, Single-peaked Preferences and Paradoxes of Variable Electorate. hal-03143741v2

  28. [28]

    J. Kelly. (1993). Almost all social choice rules are highly manipulable, but few aren’t.Social Choice and Welfare20(3): 477-494

  29. [29]

    Kilgour, J.C

    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

  30. [30]

    Laatu & W

    J. Laatu & W. Smith. (2009). The rank-order votes in the 2009 Burlington mayoral election. Online; accessed 13-July-2024,https://www.rangevoting.org/JLburl09.txt

  31. [31]

    Lepelley, F

    D. Lepelley, F. Chantreuil, & S. Berg. (1996). The likelihood of monotonicity paradoxes in run-off elections.Mathematical Social Sciences31(3): 133-146

  32. [32]

    Lepelley & V

    D. Lepelley & V. Merlin. (2001). Scoring runoff paradoxes for variable electorates.Economic Theory14(1): 53-80

  33. [33]

    Mattei & T

    N. Mattei & T. Walsh. (2013). Preflib: A library for preferences. InADT, 259–270. Springer

  34. [34]

    McCune & A

    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. [35]

    McCune & L

    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. [36]

    McCune, E

    D. McCune, E. Martin, G. Latina, & K. Simms. (2024). A comparison of sequential ranked- choice voting and single transferable vote.Journal of Computational Social Sciences7: 643-670

  37. [37]

    McCune & J

    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. [38]

    McCune & J

    D. McCune & J. Wilson. (2024). The Negative Participation Paradox in Three-Candidate Instant Runoff Elections.Theory and Decision98: 537-559

  39. [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

  40. [40]

    Mollison

    D. Mollison. (2023). Fair votes in practice. Preprint:arXiv:2303.15310

  41. [41]

    H. Moulin. (1988). Condorcet’s principle implies the no show paradox.Journal of Economic Theory45: 53–64

  42. [42]

    H. Nurmi. (1999).Voting Paradoxes and How to Deal with Them. Springer-Verlag. IR V AND THE REINFORCEMENT PARADOX 33

  43. [43]

    Ornstein & R.Z

    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

  44. [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. [45]

    Pettigrew & D

    S. Pettigrew & D. Radley. (2023). Ballot Marking Errors in Ranked-Choice Voting. Preprint: https://ssrn.com/abstract=4670677

  46. [46]

    J. P´ erez. (2001). No Show Paradoxes are a common flaw in Condorcet voting correspondences. Social Choice and Welfare18: 601–616

  47. [47]

    Plassmann & T.N

    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

  48. [48]

    Popov, A

    S. Popov, A. Popova, & M. Regenwetter. (2014). Consensus in organizations: Hunting for the social choice conundrum in APA elections.Decision,1(2), 123–146

  49. [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

  50. [50]

    Regenwetter, A

    M. Regenwetter, A. Kantor, A. Kim, & M. Ho. (2007). The unexpected empirical consensus among consensus methods.Psychological Science,18(7), 629–635

  51. [51]

    Robinette

    R. Robinette. (2023). Implications of strategic position choices by candidates.Constitutional Political Economy34: 445-457

  52. [52]

    D. Saari. (1995).Basic Geometry of Voting. Springer

  53. [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. [54]

    Stephanopoulos

    N. Stephanopoulos. (2024). Finding Condorcet. Forthcoming inWashington and Lee Law Review

  55. [55]

    W. Thomson. (2011). Consistency and its converse: an introduction.Rev. Econ. Design15: 257–291.doi10.1007/s10058-011-0109-z

  56. [56]

    Tomlinson, J

    K. Tomlinson, J. Ugander, & J. Kleinberg. (2022). Ballot Length in Instant Runoff Voting. Preprint:https://arxiv.org/pdf/2207.08958.pdf

  57. [57]

    H.P. Young. (1974). An axiomatization of Borda’s rule.Journal of Economic Theory9: 43–52

  58. [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...