Abstract
We present a geometric representation of the method of run-off voting. With this representation we can observe the non-monotonicity of the method and its susceptibility to the no-show paradox. The geometry allows us easily to identify a novel compromise rule between run-off voting and plurality voting that is monotonic.
Similar content being viewed by others
Notes
We can check this by examining profiles \(\pi\) and \(\pi ^{\prime }\). For some other pair of profiles that generate the same plurality points that \(\pi\) and \(\pi ^{\prime }\) generate, the outcome of a run-off region could very well change.
An example of monotonicity failure requires a pair of profiles. By moving back and forth between the two profiles in the pair we will see that one is vulnerable to DMF and the other vulnerable to UMF. However, Leppelley et al. and Miller show that no single-peaked profile can be vulnerable to DMF. Hence, there can be no pair of single-peaked profiles that serve as an example of monotonicity failure. Run-off voting is also monotonic on a single-peaked domain when there are four candidates, though not when there are five or more.
In 1969, in the United States, a proposed constitutional amendment to abolish the Electoral College and replace it with a direct popular election of the president and vice-president, using this 40% rule, passed with strong bipartisan support in the House of Representatives, but was not approved by Senate.
Note that the method of run-off voting is complicated by the fact that ties may occur in the first round of voting as well as in the run-off.
References
Black, D. (1958). The theory of committees and elections. Cambridge: Cambridge University Press.
Blais, A., Massicotte, L., & Dobrzynska, A. (1997). Direct presidential elections: A world summary. Electoral Studies, 16(4), 441–455.
Bouton, L. (2013). A theory of strategic voting in runoff elections. American Economic Review, 103(4), 1248–1288.
Bradberry, B. A. (1992). A geometric view of some apportionment paradoxes. Mathematics Magazine, 65(1), 3–17.
Campbell, D. E., & Kelly, J. S. (2002). Non-monotonicity does not imply the no-show paradox. Social Choice and Welfare, 19(3), 513–515.
Coombs, C. H. (1964). A theory of data. Oxford: Wiley.
Doron, G., & Kronick, R. (1977). Single transferrable vote: An example of a perverse social choice function. American Journal of Political Science, 21(2), 303–311.
Fishburn, P. C., & Brams, S. J. (1983). Paradoxes of preferential voting. Mathematics Magazine, 56(4), 207–214.
Green-Armytage, J., Tideman, T. N., & Cosman, R. (2016). Statistical evaluation of voting rules. Social Choice and Welfare, 46(1), 183–212.
Grofman, B., Chiaramonte, A., D’alimonte, R., & Feld, S. L. (2004). Comparing and contrasting the uses of two graphical tools for displaying patterns of multiparty competition: Nagayama diagrams and simplex representations. Party Politics, 10(3), 273–299.
Gudgin, G., & Taylor, P. J. (1979). Seats, votes, and the spatial organisation of elections. London: Pion.
Ibbetson, D. (1965). Comment on Hugh B. Berrington, “The General Election of 1964”. Journal of the Royal Statistical Society, Series A (General), 128, 54–55.
Jones, M. A. (2009). The geometry behind paradoxes of voting power. Mathematics Magazine, 82(2), 103–116.
Lepelley, D., Chantreuil, F., & Berg, S. (1996). The likelihood of monotonicity paradoxes in run-off elections. Mathematical Social Sciences, 31(3), 133–146.
Merrill, S. (1984). A comparison of efficiency of multicandidate electoral systems. American Journal of Political Science, 28(1), 23–48.
Merrill, S. (1985). A statistical model for Condorcet efficiency based on simulation under spatial model assumptions. Public Choice, 47(2), 389–403.
Miller, N. R. (2002). Monotonicity failure under STV and related voting systems. San Diego: Paper presented at the Annual Meeting of the Public Choice Society.
Miller, N. R. (2015). Complexities of majority voting. Working paper.
Miller, N. R. (2017). Closeness matters: Monotonicity failure in IRV elections with three candidates. Public Choice. doi:10.1007/s11127-017-0465-5.
Mueller, D. C. (2003). Public choice III. Cambridge: Cambridge University Press.
Norman, R. Z. (2012). Frequency and severity of some STV paradoxes. Miami: Paper presented at the World Meeting of the Public Choice Societies.
Nurmi, H. (1999). Voting paradoxes and how to deal with them. Berlin: Springer.
Nurmi, H. (2004). Monotonicity and its cognates in the theory of choice. Public Choice, 121(1–2), 25–49.
O’Neill, J. C. (2007). Choosing a runoff election threshold. Public Choice, 131(3–4), 351–364.
Plassmann, F., & Tideman, T. N. (2014). How frequently do different voting rules encounter voting paradoxes in three-candidate elections? Social Choice and Welfare, 42(1), 31–75.
Rivière, A. (2004). Comparing electoral systems: A geometric analysis. Public Choice, 118(3), 389–412.
Saari, D. G. (1991). Calculus and extensions of Arrow’s theorem. Journal of Mathematical Economics, 20(3), 271–306.
Saari, D. G. (1992). Millions of election outcomes from a single profile. Social Choice and Welfare, 9(4), 277–306.
Saari, D. G. (1994). Geometry of voting. New York: Springer.
Saari, D. G. (1995). Basic geometry of voting. New York: Springer.
Sanver, M. R., & Zwicker, W. S. (2012). Monotonicity properties and their adaptation to irresolute social choice rules. Social Choice and Welfare, 39(2–3), 371–398.
Shelton, W. (1972). Majorities and pluralities in elections. American Statistician, 26(5), 17–19.
Shugart, M. S., & Taagepera, R. (1994). Plurality versus majority election of presidents a proposal for a double complement rule. Comparative Political Studies, 27(3), 323–348.
Upton, G. J. G. (1976). Diagrammatic representation of three-party contests. Political Studies, 24(4), 448–454.
Yee, K.-P. (2006). Voting simulation visualizations.http://zesty.ca/voting/sim/.
Acknowledgements
I am extremely grateful to Nick Miller, Ashley Piggins, Bill Zwicker and two anonymous reviewers for many helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Proof of Proposition 1
To make matters more precise and to allow for the possibility of random tie-breaking, an outcome is a probability distribution over the candidates, indicating each candidate’s probability of winning.Footnote 4 If no random tie-breaking is required, then a probability of one is assigned to one candidate. A voting rule associates an outcome to every profile. Given a voting rule f and a profile \(\pi\), we write \(f(\pi )(A)\) for the probability of candidate A being elected. Monotonicity requires then that \(\pi (A^{\uparrow })\pi ^{\prime }\) implies \(f(\pi )(A)\le f(\pi ^{\prime })(A)\).
Take any candidate A and profiles \(\pi\) and \(\pi ^{\prime }\) with \(\pi (A^{\uparrow })\pi ^{\prime }\). Let f be the monotonic run-off rule. We must prove that \(f(\pi )(A)\le f(\pi ^{\prime })(A)\). If \(f(\pi )(A)=0\), then it follows immediately that \(f(\pi )(A)\le f(\pi ^{\prime })(A)\). So let us assume that \(f(\pi )(A)>0\).
Let us assume, by way of contradiction, that \(f(\pi )(A)>f(\pi ^{\prime })(A)\). Profile \(\pi ^{\prime }\) is obtained from \(\pi\) by promoting A on a ballot. We can see that this must be a promotion from second to first place on that ballot. Otherwise, no change in the tally of first-round votes materializes. That would in turn imply a contradiction since the promotion of A on a ballot cannot cause the outcome of a pairwise comparison with another candidate to become less favorable to A. So let us assume that A is promoted from second to first place on a ballot to obtain \(\pi ^{\prime }\) from \(\pi\).
Since \(f(\pi )(A)>0\), it must be that, at profile \(\pi\), (1) A is elected without a run-off, (2) A is in the top two in the first-round tally of votes, with both A and another candidate being above the midpoint between first and third place, or (3) A is one of three of more candidates in joint first place in the first-round tally.
- Case (1) :
-
If A is elected without a run-off at \(\pi\), then A uniquely has the most votes at \(\pi\). It follows that an additional vote for A in the first round, at the expense of another candidate, cannot cause the midpoint between first and third place to fall. Since none of the other candidates were above that threshold at \(\pi\), and since they have not gained any votes, it follows that no other candidate is above the threshold at \(\pi ^{\prime }\). Hence, A is elected without a run-off at \(\pi ^{\prime }\). So we can rule out this case.
- Case (2) :
-
A is in the top two in the first round and above the midpoint between first and third place. The promotion of A to the top of a ballot means that A must still be in the top two and must still be above the midpoint between first and third place. The other candidate who was in the top two at \(\pi\) must either still be in the top two, or in joint second place with one or more other candidates. Therefore, we either have the same run-off at \(\pi ^{\prime }\) as we had at \(\pi\), or else A is elected at \(\pi ^{\prime }\) without a run-off. So we can rule out this case also.
- Case (3) :
-
If A is one of three or more candidates in joint first place in the first round at \(\pi\) then A must be uniquely first in the first round at \(\pi ^{\prime }\). It must also be true that the candidate in second place at \(\pi ^{\prime }\) is either equidistant between first and third place, or is closer to third than to first. In either case, A is elected without a run-off. Thus, we can rule out this final case. We conclude that the monotonic run-off rule is monotonic. \(\square\)
Rights and permissions
About this article
Cite this article
Duddy, C. Geometry of run-off elections. Public Choice 173, 267–288 (2017). https://doi.org/10.1007/s11127-017-0476-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11127-017-0476-2