AbstractWe generalize the idea of a Condorcet winner to committee elections to select a Condorcet committee of size m. As in the case of a Condorcet winner, the Condorcet committee need not exist. We adapt two methods to measure how far a set of m candidates is from being the Condorcet committee. In particular, we generalize a procedure proposed by Lewis Carroll for selecting the candidate that is closest to being the Condorcet winner to allow the selection of a committee. We also generalize Kemeny’s method, which gives a complete transitive ranking, to the selection of committees and show that it is closely related to the first method.We show that these methods lead to some surprising inconsistencies. For example, the committee of size k may be disjoint from the committee of size j or they may overlap in any manner, the committee arising from Carroll’s method may appear at any locations in the Kemeny ranking, and except for two highly restrictive cases, the members of the committee arising from Kemeny’s method may appear at any location in the Kemeny ranking.
[1]
Shmuel Nitzan,et al.
The Borda Rule and Pareto Stability: A Comment
,
1979
.
[2]
Thomas C. Ratliff.
A comparison of Dodgson's method and Kemeny's rule
,
2001,
Soc. Choice Welf..
[3]
Arnold B. Urken,et al.
Classics of social choice
,
1995
.
[4]
S. Shapiro,et al.
Mathematics without Numbers
,
1993
.
[5]
Steven J. Brams,et al.
Single-Peakedness and Disconnected Coalitions
,
2002
.
[6]
P. Fishburn.
Condorcet Social Choice Functions
,
1977
.
[7]
Donald G. Saari,et al.
A geometric examination of Kemeny's rule
,
2000,
Soc. Choice Welf..