Social Choice and Welfare

, Volume 46, Issue 1, pp 81–91 | Cite as

A note on the McKelvey uncovered set and Pareto optimality

Original Paper
  • 146 Downloads

Abstract

We consider the notion of Pareto optimality under the assumption that only the pairwise majority relation is known and show that the set of necessarily Pareto optimal alternatives coincides with the McKelvey uncovered set. As a consequence, the McKelvey uncovered set constitutes the coarsest Pareto optimal majoritarian social choice function. Moreover, every majority relation is induced by a preference profile in which the uncovered alternatives precisely coincide with the Pareto optimal ones. We furthermore discuss the structure of the McKelvey covering relation and the McKelvey uncovered set.

References

  1. Bordes G (1983) On the possibility of reasonable consistent majoritarian choice: Some positive results. J Econ Theory 31(1):122–132CrossRefGoogle Scholar
  2. Brandt F, Fischer F (2008) Computing the minimal covering set. Math Soc Sci 56(2):254–268CrossRefGoogle Scholar
  3. Brandt F, Geist C (2014) Finding strategyproof social choice functions via SAT solving. In: Proceedings of the 13th international conference on autonomous agents and multi-agent systems (AAMAS), pp 1193–1200. IFAAMASGoogle Scholar
  4. Brandt F, Geist C, Seedig GH (2014) Identifying \(k\)-majority digraphs via SAT solving. In: Proceedings of the 1st AAMAS workshop on exploring beyond the worst case in computational social choice (EXPLORE)Google Scholar
  5. Duggan J (2013) Uncovered sets. Soc Choice Welf 41(3):489–535CrossRefGoogle Scholar
  6. Dushnik B, Miller EW (1941) Partially ordered sets. Am J Math 63(3):600–610CrossRefGoogle Scholar
  7. Dutta B, Laslier J-F (1999) Comparison functions and choice correspondences. Soc Choice Welf 16(4):513–532CrossRefGoogle Scholar
  8. Gaertner W (2009) A primer in social choice theory: revised edition. In: LSE perspectives in economic analysis. Oxford University Press, OxfordGoogle Scholar
  9. Gebser M, Kaminski R, Kaufmann B, Ostrowski M, Schaub T, Schneider M (2011) Potassco: the Potsdam answer set solving collection. AI Commun 24(2):107–124Google Scholar
  10. Gebser M, Kaminski R, Kaufmann B, Schaub T (2012) Answer set solving in practice. Synth Lect Artif Intell Mach Learn 6(3):1–238CrossRefGoogle Scholar
  11. McGarvey DC (1953) A theorem on the construction of voting paradoxes. Econometrica 21(4):608–610CrossRefGoogle Scholar
  12. McKelvey RD (1986) Covering, dominance, and institution-free properties of social choice. Am J Polit Sci 30(2):283–314CrossRefGoogle Scholar
  13. Moulin H (1986) Choosing from a tournament. Soc Choice Welf 3(4):271–291CrossRefGoogle Scholar
  14. Peris JE, Subiza B (1999) Condorcet choice correspondences for weak tournaments. Soc Choice Welf 16(2):217–231CrossRefGoogle Scholar
  15. Schrijver A (1986) Theory of linear and integer programming. Wiley, New YorkGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Felix Brandt
    • 1
  • Christian Geist
    • 1
  • Paul Harrenstein
    • 2
  1. 1.Technische Universität MünchenMunichGermany
  2. 2.University of OxfordOxfordUK

Personalised recommendations