In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy "tops only." That is, they depend only on which alternative each individual prefers the most, not on which alternative she prefers the second most, the third,\dots, or the least. The functions are defined on the domain of profiles measurable with respect to a Boolean algebra of coalitions. The unrestricted domain of profiles is an example of such a domain. I also prove an extension theorem.
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.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)