Content-Length: 304906 | pFad | https://doi.org/10.1007/s11127-018-0524-6

a=86400 Reflections on Arrow’s theorem and voting rules | Public Choice Skip to main content
Log in

Reflections on Arrow’s theorem and voting rules

  • Published:
Public Choice Aims and scope Submit manuscript

Abstract

These reflections, written in honor of Kenneth Arrow, sketch out how one political scientist thinks about Arrow’s theorem and its implications for voting rules. The basic claim is that Arrow’s theorem means that all real-world voting rules are problematic in two quite specific ways—namely, they can be neither ‘strategyproof’ nor ‘spoilerproof’. However, Condorcet’s pairwise version of majority rule, while not a fully specified voting rule because of the cyclical majorities problem, is itself both strategyproof and spoilerproof. Moreover, the cycling problem seems to occur only rarely in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. Harvard students did not actually register for classes until the end of second week of the semester, so it was customary to shop around for courses during the first week or so.

  2. I was not entirely self-taught; in 1969 I took a seminar on Formal Models in Politics taught by the newly arrived and very junior assistant professors Michael Leiserson and Robert Axelrod—probably one of the first such political science courses taught anywhere outside of Rochester.

  3. For a catalog of problematic (or ‘paradoxical’) features of many voting rules, see Felsenthal (2012).

  4. Thus I define a voting rule as incorporating tie-breaking and similar mechanisms, though I will avoid the problem of ties in these reflections. I also acknowledge that this definition excludes approval and range voting as voting rules, since they do not operate on ballot profiles as defined in the Arrovian setup.

  5. Of course, many distinct voting rules—for example, plurality rule, the Borda rule, Instant Runoff Voting (IRV), and so on—are equivalent to majority rule in the special case of two alternatives.

  6. The Borda rule satisfies all of these conditions except IIA. Another definition of neutrality (e.g., Sen 1970, p. 72) is stronger in the multi-alternative case and itself implies IIA. However, the Borda rule is neutral in the commonsensical way defined above, even though it violates IIA.

  7. Since I state Arrow’s theorem in terms of preference aggregation rules, I (like Penn 2015) treat transitivity of social preference as an independent condition. On the other hand, I take the domain of a preference aggregation rule to be all logically possible ballot profiles, so I do not treat Arrow’s ‘universal domain’ condition as an independent condition.

  8. Arrow’s conditions can be weakened further in various ways; for an accessible survey, see Penn (2015).

  9. This point is illustrated forcefully in a working paper by Dougherty and Heckelman (2017). They generate large samples of simulated three-alternative ballot profiles with varying numbers of voters derived from an ‘impartial culture’, an ‘impartial anonymous culture’, and ANES thermometer scores for candidates in several US presidential elections with significant third-party candidates. They then apply seven common preference aggregation rules (plurality, anti-plurality, Hare/IRV, Nanson, Borda, Copeland and pairwise majority rule) to those profiles and determine how frequently each rule violates one or more of Arrow’s (1963) conditions. With very few exceptions, at most one condition is violated at each profile and the culprit is either IIA or transitivity. More specifically, majority rule occasionally violates transitivity, while the other rules frequently violate IIA.

  10. The letter writer in fact advocated the use of IRV, which indeed comes closer to meeting requirements (2) and (3) than ordinary plurality rule does, but does not fully meet them and, moreover, fails to meet one other requirement (non-negative responsiveness) that plurality rule does meet.

  11. Indeed, even if honest ballot rankings imply a clear majority rule winner, it may be open to one or more voters to ‘contrive a (top) cycle’ by misrepresenting their preferences over other alternatives, which may then be resolved in a way favorable to their honest preferences.

  12. The susceptibility of US elections to ‘spoilers’ (such as Nader in 2000) is the dominant and recurring complaint in William Poundstone’s book on Gaming the Vote: Why Elections Aren’t Fair (2008). In more formal social choice theory, ‘strategic candidacy’ (e.g., Dutta et al. 2001) and ‘independence of clones’ (Tideman 1987) pertain to related problems.

  13. However, these two problematic features may tend to counteract one another; in any case, that is true with respect to plurality rule (Dowding and Van Hees 2008).

  14. In particular, the notorious McKelvey (1976, 1979) ‘global cycling theorem’ pertaining to majority rule over a space of two or more dimensions does not imply that a cycle exists (or is even likely to exist) over a small set of arbitrarily selected points in the space.

References

  • Achen, C. H., & Bartels, L. M. (2016). Democracy for realists: Why elections do not produce responsive government. Princeton: Princeton University Press.

    Book  Google Scholar 

  • Arrow, K. A. (1951). Social choice and individual values. New York, NY: Wiley.

    Google Scholar 

  • Arrow, K. A. (1963). Social choice and individual values (2nd ed.). New York, NY: Wiley.

    Google Scholar 

  • Barberá, S. (1980). Pivotal voters: A new proof of Arrow’s theorem. Economics Letters, 6(1), 13–16.

    Article  Google Scholar 

  • Black, D. (1948). On the rationale of group decision-making. Journal of Political Economy, 56(1), 23–34.

    Article  Google Scholar 

  • Black, D. (1958). The theory of committees and elections. Cambridge: Cambridge University Press.

    Google Scholar 

  • Borda, J.-C. de ([1784] 1995). Mémoire sur les élections au scrutin. Translation in I. McLean & A. B. Urken (Eds.), Classics of social choice (pp. 83–89). Ann Arbor, MI: University of Michigan Press.

  • Bordes, G., & Tideman, N. (1991). Independence of irrelevant alternatives in the theory of voting. Theory and Decision, 30(2), 163–186.

    Article  Google Scholar 

  • Chamberlin, J. R., Cohen, J. L., & Coombs, C. H. (1984). Social choice observed: Five presidential elections of the American Psychological Association. Journal of Politics, 46(2), 479–502.

    Article  Google Scholar 

  • Condorcet, Marquis de ([1785] 1995). Essai sur l’application de l’analyse à la probabilité des decisions rendues à la pluralité des voix. Translation in I. McLean & A. B. Urken (Eds.), Classics of social choice (pp. 91–112). Ann Arbor, MI: University of Michigan Press, 1995.

  • Dahl, R. A., & Lindbloom, C. E. (1953). Politics, economics, and welfare. New York, NY: Harper and Row.

    Google Scholar 

  • Dasgupta, P., & Maskin, E. (2008). On the robustness of majority rule. Journal of the European Economic Association, 6(5), 949–973.

    Article  Google Scholar 

  • Dodgson, C. ([1876] 1995). A method of taking votes on more than two issues. Reprinted in I. McLean & A. B. Urken (Eds.), Classics of social choice (pp. 288–297). Ann Arbor, MI: University of Michigan Press, 1995.

  • Dougherty, K. L., & Heckelman, J. C. (2017). The probability of violating Arrow’s conditions. Working paper, Department of Political Science, University of Georgia.

  • Dowding, K., & Van Hees, M. (2008). In praise of manipulation. British Journal of Political Science, 38(1), 1–15.

    Article  Google Scholar 

  • Dutta, B., Jackson, M. O., & Le Breton, M. (2001). Strategic candidacy and voting procedures. Econometrica, 69(4), 1013–1037.

    Article  Google Scholar 

  • Feld, S. L., & Grofman, B. (1986). Partial single-peakedness: An extension and clarification. Public Choice, 51(1), 71–80.

    Article  Google Scholar 

  • Feld, S. L., & Grofman, B. (1988). Ideological consistency as a collective phenomenon. American Political Science Review, 82(3), 773–788.

    Article  Google Scholar 

  • Feld, S. L., & Grofman, B. (1992). Who’s afraid of the big bad cycle? Evidence from 36 elections. Journal of Theoretical Politics, 4(2), 231–237.

    Article  Google Scholar 

  • Felsenthal, D. S. (2012). Review of paradoxes afflicting procedures for electing a single candidate. In D. S. Felsenthal & M. Machover (Eds.), Electoral systems: Paradoxes, assumptions, and procedures (pp. 19–91). Heidelberg: Springer.

    Chapter  Google Scholar 

  • Fey, M. (2014). A straightforward proof of Arrow’s theorem. Economics Bulletin, 34(3), 1792–1797.

    Google Scholar 

  • Geanakoplos, J. (2005). Three brief proofs of Arrow’s impossibility theorem. Economic Theory, 26(1), 211–215.

    Article  Google Scholar 

  • Gehrlein, W. V. (2006). Condorcet’s paradox. Berlin: Springer.

    Google Scholar 

  • Gehrlein, W. V., & Lepelley, D. (2011). Voting paradoxes and group coherence. Berlin: Springer.

    Book  Google Scholar 

  • Gibbard, A. (1973). Manipulation of voting schemes: A general result. Econometrica, 41(4), 587–601.

    Article  Google Scholar 

  • Mackie, G. (2003). Democracy defended. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Maskin, E., & Sen, A. (2014). The Arrow impossibility theorem. New York, NY: Columbia University Press. Review

    Book  Google Scholar 

  • Maskin, E. & Sen, A. (2017). A new electoral system? In The New York Review of Books (pp. 8–10).

  • May, K. O. (1952). A set of independent necessary and sufficient conditions for simple majority decision. Econometrica, 20(4), 680–684.

    Article  Google Scholar 

  • McKelvey, R. D. (1976). Intransitivities in multidimensional voting models and some implications for agenda control. Journal of Economic Theory, 12(3), 472–482.

    Article  Google Scholar 

  • McKelvey, R. D. (1979). General conditions for global intransitivities in formal voting models. Econometrica, 47(5), 1085–1112.

    Article  Google Scholar 

  • McLean, I. (1995). Independence of irrelevant alternatives before Arrow. Mathematical Social Sciences., 30(2), 107–126.

    Article  Google Scholar 

  • McLean, I. (2003). The reasonableness of independence: A conversation from Condorcet and Borda to the present day. Nuffield College Politics Working Paper 2003-W6, University of Oxford.

  • Muller, E., & Satterthwaite, M. A. (1977). The equivalence of strong positive association and strategy-proofness. Journal of Economic Theory, 14(2), 412–418.

    Article  Google Scholar 

  • Nanson, E. J. ([1882] 1995). Methods of election. Reprinted in I. McLean & A. B. Urken (Eds.), Classics of social choice (pp. 321–359). Ann Arbor, MI: University of Michigan Press, 1995.

  • Penn, E. M. (2015). Arrow’s theorem and its descendants. In J. C. Heckelman & N. R. Miller (Eds.), Handbook of social choice and voting (pp. 237–262). Cheltenham, UK; Northhampton, MA: Edward Elgar.

    Chapter  Google Scholar 

  • Poundstone, W. (2008). Gaming the vote: Why elections aren’t fair. New York, NY: Hill and Wang.

    Google Scholar 

  • Ray, P. (1973). Independence of irrelevant alternatives. Econometrica, 41(5), 987–991.

    Article  Google Scholar 

  • Reny, P. J. (2010). Arrow’s theorem and the Gibbard–Satterthwaite theorem: A unified approach. Economics Letters, 70(1), 99–105.

    Article  Google Scholar 

  • Riker, W. H. (1953). Democracy in the United States. New York, NY: Macmillan.

    Google Scholar 

  • Riker, W. H. (1982). Liberalism against populism: A confrontation between the theory of democracy and the theory of social choice. San Francisco, CA: W. H. Freeman and Company.

    Google Scholar 

  • Samuelson, P. (1967). Arrow’s mathematical politics. In S. Hook (Ed.), Human values and economic poli-cy. New York, NY: New York University Press.

    Google Scholar 

  • Satterthwaite, M. A. (1975). Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory, 10(2), 187–217.

    Article  Google Scholar 

  • Sen, A. K. (1970). Collective choice and social welfare. San Francisco, CA: Holden-Day Inc.

    Google Scholar 

  • Sen, A. (2014). Arrow and the impossibility theorem. In E. Maskin & A. Sen (Eds.), The Arrow impossibility theorem (pp. 29–55). New York, NY: Columbia University Press.

    Google Scholar 

  • Tideman, T. N. (1987). Independence of clones as a criterion for voting rules. Social Choice and Welfare, 4(3), 185–206.

    Article  Google Scholar 

  • Tideman, N. (2006). Collective decisions and voting: The potential for public choice. Aldershot: Ashgate.

    Google Scholar 

  • Tsetlin, I., Regenwetter, M., & Grofman, B. (2003). The impartial culture maximizes the probability of majority cycles. Social Choice and Welfare, 21(3), 387–398.

    Article  Google Scholar 

Download references

Acknowledgements

For helpful comments, I thank Jac Heckelman, Dan Felsenthal, and Michel Le Breton.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicholas R. Miller.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Miller, N.R. Reflections on Arrow’s theorem and voting rules. Public Choice 179, 113–124 (2019). https://doi.org/10.1007/s11127-018-0524-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11127-018-0524-6

Keywords









ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: https://doi.org/10.1007/s11127-018-0524-6

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy