[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Coincidence of Condorcet committees

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

Abstract

The Condorcet Committee à la Gehrlein (CCG) is a fixed-size subset of candidates such that each of its members defeats in a pairwise contest any candidate outside. The Condorcet Committee à la Fishburn (CCF) is a fixed-size subset of candidates that is preferred to all other subsets of the same size by a majority of voters. In general, these two types of Condorcet committees may not always exist. Kaymak and Sanver (Soc Choice Welf 20:477–494, 2003) studied the conditions under which the CCF exists under a large class of extensions of preferences. We focus here on the most important members of their class, the lexicographic extension of preferences, and we define more precisely, the conditions under which these committees coincide when they exist. Our results depart from the rather optimistic conclusions of Kaymak and Sanver (Soc Choice Welf 20:477–494, 2003) on the coincidence between the CCG and the CCF. We exhibit profiles for which the CCF is empty while the CCG exists and the preferences are all of lexicographic type. Furthermore, we obtain the same conclusion when we derive preferences on candidates from those on sets of candidates using the separability assumption.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. See also Black (1958) and McLean and Urken (1995).

  2. This definition of the CCG is also known in the literature as the Strong Condorcet Committee; see also Kaymak and Sanver (2003) and Ratliff (2003).

  3. A linear order is a binary relation that is transitive, complete and antisymmetric. The binary relation R on A is transitive if for \(a,b,c\in A\), if aRb and bRc then aRc. R is antisymmetric if for all for \(a\ne b\), \(aRb\Rightarrow \lnot bRa\); if we have aRb and bRa, then \(a=b\). R is complete if and only if for all \(a,b\in A\), we have aRb or bRa.

  4. Without being exhaustive, we can list Arrow and Hurwicz (1972), Packard (1979), Nitzan and Pattanaik (1984), Pattanaik and Peleg (1984), Barberà et al. (1984) and Pérez et al. (2012).

  5. As we only consider strict preferences in this paper, we will omit to present the versions of the properties that deal with weak preferences.

  6. Recall that \(aR_{i}b\) means that individual i finds a at least as good as b.

  7. We thank an anonymous referee for suggesting this profile with three voters.

  8. For more on this, the reader can refer to Benoit and Kornhauser (1991, p. 7).

  9. This also apply for the Simple voting as noticed by Benoit and Kornhauser (1991, 1994, 1999).

References

  • Arrow KJ, Hurwicz L (1972) An optimality criterion for decision-making under ignorance. In: Carter CF, Ford JL (eds) Uncertainty and expectations in economics: essays in honour of G.L.S. Shackle. Basil Blackwell, Oxford

    Google Scholar 

  • Aziz H, Lang J, Monnot J (2016) Computing Pareto optimal committees. IJCAI 2016:60–66

    Google Scholar 

  • Barberà S, Barrett CR, Pattanaik PK (1984) On some axioms for ranking sets of alternatives. J Econ Theory 33:301–308

    Article  Google Scholar 

  • Barberà S, Bossert W, Pattanaik PK (2001) Ordering sets of objects. In: Barberà S, Hammond PJ, Seidl C (eds) Handbook of utility theory, Ch. 17, vol 2. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  • Barberà S, Coelho D (2008) How to choose a non-controversial list with k names. Soc Choice Welf 31:79–96

    Article  Google Scholar 

  • Benoit JP, Kornhauser LA (1991)Voting simply in the election of assemblies. Technical report 91-32, C.V. Starr Center for Applied Economics, New York University

  • Benoit JP, Kornhauser LA (1994) Social choice in a representative democracy. Am Polit Sci Rev 88:185–192

    Article  Google Scholar 

  • Benoit JP, Kornhauser LA (1999) On the separability of assembly preferences. Soc Choice Welf 16:429–439

    Article  Google Scholar 

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

    Google Scholar 

  • Coelho D (2004) Understanding, evaluating and selecting voting rules through games and axioms. Phd Thesis, Universitat Autonoma de Barcelona. http://ddd.uab.es/record/36576?ln=en

  • de Condorcet M (1785) Essai sur l’Application de l’Analyse à la Probabilité des Décisions Rendues à la Pluralité des Voix. Paris

  • Darmann A (2013) How hard is it to tell which is a Condorcet committee? Math Soc Sci 66(3):282–292

    Article  Google Scholar 

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

    Google Scholar 

  • Dodgson CL (1884) The principles of parliamentary representation. Harrison and Sons Publisher, London

    Google Scholar 

  • Dodgson CL (1885a) The principles of parliamentary representation: postscript to supplement. E. Baxter Publisher, Oxford

    Google Scholar 

  • Dodgson CL (1885b) The principles of parliamentary representation: supplement. E. Baxter Publisher, Oxford

    Google Scholar 

  • Elkind E, Faliszewski P, Skowron P, Slinko A (2017) Properties of multiwinner scoring rules. Soc Choice Welf 48:599–632

    Article  Google Scholar 

  • Elkind E, Lang J, Saffidine A (2015) Condorcet winning sets. Soc Choice Welf 44(3):493–517

    Article  Google Scholar 

  • Fishburn PC (1981) An analysis of simple voting systems for electing committees. SIAM J Appl Math 41:499–502

    Article  Google Scholar 

  • Gehrlein WV (1985) The Condorcet criterion and committee selection. Math Soc Sci 10:199–209

    Article  Google Scholar 

  • Good IJ (1971) A note on Condorcet sets. Public Choice 10(1):97–101

    Article  Google Scholar 

  • Hill ID (1988) Some aspects of elections: to fill one seat or many. J R Stat Soc 151:243–275

    Article  Google Scholar 

  • Kaymak B, Sanver MR (2003) Sets of alternatives as Condorcet winners. Soc Choice Welf 20:477–494

    Article  Google Scholar 

  • Kamwa E (2017a) On stable rules for selecting committees. J Math Econ 70:36–44

    Article  Google Scholar 

  • Kamwa E (2017b) Stable rules for electing committees and divergence on outcomes. Group Decis Negot 26(3):547–564

    Article  Google Scholar 

  • Lang J, Xia L (2016) Voting in combinatorial domains. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of computational social choice, Ch 9. Cambridge University Press, Cambridge

    Google Scholar 

  • McLean I, Urken A (1995) Classics of social choice. Michigan University Press, Ann Arbor

    Book  Google Scholar 

  • Nitzan S, Pattanaik PK (1984) Median-based extensions of an ordering over a set to the power set: an axiomatic characterization. J Econ Theory 34:252–261

    Article  Google Scholar 

  • Packard DJ (1979) Preference relations. J Math Psychol 19:295–306

    Article  Google Scholar 

  • Pattanaik PK, Peleg B (1984) An axiomatic characterization of the lexicographic maximin extension of an ordering over a set to the power set. Soc Choice Welf 1:113–122

    Article  Google Scholar 

  • Pérez J, Jimeno JL, García E (2012) No show paradox in Condorcet k-voting procedures. Group Decis Negot 21(3):291–303

    Article  Google Scholar 

  • Ratliff TC (2003) Some startling inconsistencies when electing committees. Soc Choice Welf 21:433–454

    Article  Google Scholar 

  • Ratliff TC, Saari DG (2014) Complexities of electing diverse committees. Soc Choice Welf 43:55–71

    Article  Google Scholar 

Download references

Acknowledgements

We are grateful to Bernard Grofman, Hans Peters, Ashley Piggins, Claudio Zoli and to two anonymous reviewers for all their valuable comments. We would like to thank all the participants of the Voting sessions at the 2013 Annual Meeting of the Public Choice Society (New Orleans), at the 2013 Annual Meeting of the Association for Public Economic Theory (Lisbon) and at the 2013 joint 62nd AFSE Meeting-12th Journées LAGV (Aix-en-Provence). Thanks also to Reiko Gotoh and the members of the Institute of Economic Research-Hitotsubashi University (Japan) for their remarks and suggestions. Vincent Merlin acknowledges the support from the project ANR-14-CE24-0007-01 CoCoRICo-CoDec.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eric Kamwa.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamwa, E., Merlin, V. Coincidence of Condorcet committees. Soc Choice Welf 50, 171–189 (2018). https://doi.org/10.1007/s00355-017-1079-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00355-017-1079-z

Navigation