Jerry S. Kelly (Department of Economics, Syracuse University, Syracuse, NY 13245-1090, USA) Donald E. Campbell () (Department of Economics and The Program in Public Policy, The College of William and Mary, Williamsburg, VA 23187-8795, USA)
Abstract
We characterize strategy-proof social choice procedures when choice sets need not be singletons. Sets are compared by leximin. For a strategy-proof rule g, there is a positive integer k such that either (i) the choice sets g(r) for all profiles r have the same cardinality k and there is an individual i such that g(r) is the set of alternatives that are the k highest ranking in i's preference ordering, or (ii) all sets of cardinality 1 to k are chosen and there is a coalition L of cardinality k such that g(r) is the union of the tops for the individuals in L. There do not exist any strategy-proof rules such that the choice sets are all of cardinality $k^*$ to k where $1 < k^* < k$.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Publisher Info
Article provided by Springer in its journal Economic Theory.