A note on the McKelvey uncovered set and Pareto optimality
- 146 Downloads
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.
- 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
- 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
- Gaertner W (2009) A primer in social choice theory: revised edition. In: LSE perspectives in economic analysis. Oxford University Press, OxfordGoogle Scholar
- 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
- Schrijver A (1986) Theory of linear and integer programming. Wiley, New YorkGoogle Scholar