A note on the McKelvey uncovered set and Pareto optimality

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.

[1]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[2]  W. Trotter,et al.  Inequalities in dimension theory for posets , 1975 .

[3]  H. Moulin.  Choosing from a tournament , 1986 .

[4]  David C. Mcgarvey.  A THEOREMI ON THE CONSTRUCTION OF VOTING PARADOXES , 1953 .

[5]  Oliver Pretzel,et al.  On the Dimension of Partially Ordered Sets , 1977, J. Comb. Theory, Ser. A.

[6]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[7]  Scott L. Feld,et al.  The structure of the Banks set , 1990 .

[8]  W. A. Wallis,et al.  UNCOVERED SETS , 2011 .

[9]  Wulf Gaertner,et al.  A Primer in Social Choice Theory: Revised Edition , 2009 .

[10]  Felix Brandt,et al.  Finding strategyproof social choice functions via SAT solving , 2014, AAMAS.

[11]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[12]  Martin Gebser,et al.  Answer Set Solving in Practice , 2012, Answer Set Solving in Practice.

[13]  Georges Bordes.  On the possibility of reasonable consistent majoritarian choice: Some positive results , 1983 .

[14]  Richard D. McKelvey,et al.  Covering, Dominance, and Institution Free Properties of Social Choice , 1986 .

[15]  Hervé Moulin,et al.  Choice functions over a finite set: A summary , 1985 .

[16]  Begoña Subiza Martínez,et al.  Condorcet choice correspondences for weak tournaments , 1997 .

[17]  Bhaskar Dutta,et al.  Comparison functions and choice correspondences , 1999 .

[18]  Felix Brandt,et al.  Identifying k-Majority Digraphs via SAT Solving , 2014 .

[19]  Felix A. Fischer,et al.  Computing the minimal covering set , 2008, Math. Soc. Sci..