Skip to main content
Log in

Are Condorcet procedures so bad according to the reinforcement axiom?

  • Original Paper
  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

Abstract

A Condorcet social choice procedure elects the candidate that beats every other candidate under simple majority when such a candidate exists. The reinforcement axiom roughly states that given two groups of individuals, if these two groups select the same alternative, then this alternative must also be selected by their union. Condorcet social choice procedures are known to violate this axiom. Our goal in this paper is to put this important voting theory result into perspective. We then proceed by evaluating how frequently this phenomenon is susceptible to occur.

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

Access this article

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. \(C_{1}\) was introduced by Black (1958), \(C_{2}\) by Copeland (1951), \(C_{3}\) by Dodgson (1876), \(C_{4}\) and \(C_{5}\) by Young (1975), \(C_{6}\) by Kemeny (1959) and Levenglick (1975), \(C_{7}\) by Schwartz (1972), and \(C_{8}\) by Fishburn (1970).

  2. with a complete enumeration procedure of voting situations.

  3. Note that in the tables, the frequencies are in percentages.

  4. The main difficulty encountered is the evaluation of 10-dimensional volumes over more than 40 parameterized polytopes.

  5. Note that the minor differences between Tables 3 and 4 are a consequence of sampling only 200,000 profiles.

References

  • Berg S, Lepelley D (1993) Note sur le calcul de la probabilité des paradoxes du vote. Math Inf Sci Hum 120:33–48

    Google Scholar 

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

    Google Scholar 

  • Copeland AH (1951) A “reasonable” social welfare function. In: University of Michigan seminar on applications of mathematics to the social science, Mimeographed

  • Courtin S, Mbih B, Moyouwou I, Senné T (2010) The reinforcement axiom under sequential positional rules. Soc Choice Wel 35:473–500

    Article  Google Scholar 

  • Courtin S, Mbih B, Moyouwou (2012) Condorcet procedures and the reinforcement axiom, THEMA working paper No. 2012-37

  • Dodgson CL (1876) A method of taking votes on more than two issues. Clarendon Press, Oxford

    Google Scholar 

  • Fishburn PC (1970) Intransitive indifference with unequal indifference intervals. J Math Psychol 7:144–149

    Article  Google Scholar 

  • Fishburn PC (1977) Condorcet social choice functions. SIAM J Appl Math 33:469–489

    Article  Google Scholar 

  • Fishburn PC, Gehrlein WV (1976) Condorcet’s paradox and anonymous preference profiles. Public Choice 26:1–18

    Article  Google Scholar 

  • Gehrlein WV (2006) Condorcet’s paradox. Springer, Berlin

    Google Scholar 

  • Kelly JS (1993) Almost all social choice rules are highly manipulable, but a few aren’t. Soc Choice Welf 2:161–175

    Google Scholar 

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

    Google Scholar 

  • Lepelley D, Louichi A, Smaoui H (2008) On Ehrhart polynomials and probability calculations in voting theory. Soc Choice Welf 30:363–383

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Nitzan S (1985) The vulnerability of point-voting schemes to preference variation and strategic manipulation. Public Choice 47:349–370

    Article  Google Scholar 

  • Nurmi H (1987) Comparing voting systems. D. Reidel, Dordrecht

    Book  Google Scholar 

  • Nurmi H (1999) Voting paradoxes and how to deal with them. Springer, Berlin

    Book  Google Scholar 

  • Nurmi H (2002) Voting procedures under uncertainty. Springer, Berlin

    Book  Google Scholar 

  • Plassmann F, Tideman TN (2013) How frequently do different voting rules encounter voting paradoxes in three-candidate elections? Soc Choice Welf. doi: 10.1007/s00355-013-0720-8

  • Regenwetter M, Grofman B, Marley AAJ, Tsetlin IM (2006) Behavioral social choice. Cambridge University Press, Cambridge

    Google Scholar 

  • Saari DG (2006) Which is better: the Condorcet or Borda winner? Soc Choice Welf 26:107–130

    Article  Google Scholar 

  • Schwartz T (1972) Rationality and the myth of the maximum. Noûs 6:97–117

    Article  Google Scholar 

  • Smith JH (1973) Aggregation of preferences with variable electorate. Econometrica 41:1027–1041

    Article  Google Scholar 

  • Wilson MC, Pritchard G (2007) Probability calculations under the IAC hypothesis. Math Soc Sci 54:244–256

    Article  Google Scholar 

  • Young HP (1974) An axiomatization of Borda’s rule. J Econ Theory 9:43–52

    Article  Google Scholar 

  • Young HP (1975a) Social choice scoring functions. SIAM J Appl Math 28:824–838

    Article  Google Scholar 

  • Young HP (1975b) Extending Condorcet’s rule. The City University of New York, Mimeographed

Download references

Acknowledgments

This research has been developed within the center of excellence MME-DII (ANR-11-LBX-0023-01). We are grateful to two anonymous referees and one associate editor for very valuable comments and suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sébastien Courtin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Courtin, S., Mbih, B. & Moyouwou, I. Are Condorcet procedures so bad according to the reinforcement axiom?. Soc Choice Welf 42, 927–940 (2014). https://doi.org/10.1007/s00355-013-0758-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00355-013-0758-7

Keywords

Navigation