Skip to main content

Pairwise Voting Rules in Restricted Domains: The Disappearance and Persistence of Some Monotonicity Paradoxes

  • Chapter
  • First Online:
Transactions on Computational Collective Intelligence XXXV

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 12330))

  • 197 Accesses

Abstract

The property of participation is satisfied by a voting rule if under no circumstances it is to the benefit of a voter to abstain rather than vote according to his/her preferences. By Moulin’s result of 1988 all voting rules that always elect a Condorcet winner when one exists fail on the property of participation [16]. Focusing on preference profiles that are restricted to those having a Condorcet winner we ask whether Moulin’s result holds under these preference profiles. It turns out that while some types of monotonicity paradoxes vanish in the Condorcet domains, others persist.

H. Nurmi—The author is indebted to the late Dan S. Felsenthal for numerous conversations in which the problems touched upon in this article were discussed. Those conversations culminated in the joint monograph [5] which this article largely draws upon. The constructive comments of the referees on an earlier version are gratefully acknowledged.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A Condorcet winner is a candidate that would defeat all others in pairwise majority votes.

  2. 2.

    This division is not a partition as some rules, notably the Borda count, can be implemented in both binary and positional manner. Moreover, there are voting rules that are based on neither binary nor positional principles, e.g. a randomized dictatorship.

  3. 3.

    Dodgson’s method is discussed in some detail e.g. in [19]. Due to its computational properties, this method has been of particular interest among the computational social choice scholars. See e.g. [3].

  4. 4.

    This is not an accident, but happens every time a Condorcet paradox profile is added to another profile. This is because the Borda scores of each candidate in a Condorcet paradox profile are equal and, thus, the Borda score of each candidate in the original profile is added by the same number keeping the score differences unchanged.

  5. 5.

    Duddy has generalized the incompatibility to profiles where the preference rankings are weak instead of strict [4]. Other variations of the incompatibility are discussed in [17].

References

  1. Black, D.: The Theory of Committees and Elections. Cambridge University Press, Cambridge (1958)

    MATH  Google Scholar 

  2. Brandt, F., Geist, C., Peters, D.: Optimal bounds for the no show paradox via SAT solving. Math. Soc. Sci. 90, 18–27 (2017)

    Article  MathSciNet  Google Scholar 

  3. Caragiannis, I., Hemaspaandra, E., Hemaspaandra, L.: Dodgson’s rule and Young’s rule. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, pp. 103–126. Cambridge University Press, New York (2016)

    Chapter  Google Scholar 

  4. Duddy, C.: Condorcet’s principle and the strong no show paradoxes. Theor. Decis. 77, 275–285 (2014)

    Article  MathSciNet  Google Scholar 

  5. Felsenthal, D.S., Nurmi, H.: Voting Procedures Under a Restricted Domain. An Examination of the (In)Vulnerability of 20 Voting Procedures to Five Main Paradoxes. SE. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-12627-8

    Book  Google Scholar 

  6. Fishburn, P.C., Brams, S.J.: Paradoxes of preferential voting. Math. Mag. 56, 207–214 (1983)

    Article  MathSciNet  Google Scholar 

  7. Gehrlein, W.V., Lepelley, D.: Voting Paradoxes and Group Coherence. The Condorcet Efficiency of Voting Rules. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-03107-6

    Book  MATH  Google Scholar 

  8. Gehrlein, W.V., Lepelley, D.: Elections, Voting Rules and Paradoxical Outcomes. SCW. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64659-6

    Book  MATH  Google Scholar 

  9. Hoag, C.G., Hallett, G.H.: Proportional Representation. The Macmillan Co., New York (1926)

    Google Scholar 

  10. Kasper, L., Peters, H., Vermeulen, D.: Condorcet consistency and the strong no show paradoxes. Math. Soc. Sci. 99, 36–42 (2019)

    Article  MathSciNet  Google Scholar 

  11. Kemeny, J.: Mathematics without numbers. Daedalus 88, 577–591 (1959)

    Google Scholar 

  12. Kramer, G.H.: A dynamical model of political equilibrium. J. Econ. Theory 16, 310–333 (1977)

    Article  MathSciNet  Google Scholar 

  13. Levenglick, A.: Fair and reasonable election systems. Behav. Sci. 20, 34–46 (1975)

    Article  Google Scholar 

  14. Meredith, J.C.: Proportional Representation in Ireland. Edward Ponsonby Ltd., Dublin, Simpkin, Marshall, Hamilton, Kent, & Co, London (Reprint from the collections of the University of California Libraries) (1913)

    Google Scholar 

  15. Miller, N.R.: Closeness matters: monotonicity failure in IRV elections with three candidates. Public Choice 173, 91–108 (2017)

    Article  Google Scholar 

  16. Moulin, H.: Condorcet’s principle implies the no-show paradox. J. Econ. Theory 45, 53–64 (1988)

    Article  MathSciNet  Google Scholar 

  17. Núñez, M., Sanver, M.R.: Revisiting the connection between the no-show paradox and monotonicity. Math. Soc. Sci. 90, 9–17 (2017)

    Article  MathSciNet  Google Scholar 

  18. Nurmi, H.: Voting procedures: a summary analysis. Br. J. Polit. Sci. 13, 181–208 (1983)

    Article  Google Scholar 

  19. Nurmi, H.: Reflections on two old condorcet extensions. Trans. Comput. Collective Intell. XXXI, 9–21 (2018)

    Google Scholar 

  20. Pérez, J.: Incidence of no-show paradoxes in Condorcet choice functions. Investigaciones Económicas XIX, 139–154 (1995)

    Google Scholar 

  21. Pérez, J.: The strong no show paradoxes are a common flaw in Condorcet voting correspondences. Soc. Choice Welfare 18, 601–616 (2001)

    Article  MathSciNet  Google Scholar 

  22. Tideman, N.: Collective Decisions and Voting: The Potential for Public Choice. Ashgate, Aldershot (2006)

    Google Scholar 

  23. Young, H.P.: Extending Condorcet’s rule. J. Econ. Theory 16, 335–353 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hannu Nurmi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Nurmi, H. (2020). Pairwise Voting Rules in Restricted Domains: The Disappearance and Persistence of Some Monotonicity Paradoxes. In: Nguyen, N.T., Kowalczyk, R., Mercik, J., Motylska-Kuźma, A. (eds) Transactions on Computational Collective Intelligence XXXV. Lecture Notes in Computer Science(), vol 12330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-62245-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-62245-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-62244-5

  • Online ISBN: 978-3-662-62245-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics