May's theorem in an infinite setting
We generalize May's theorem to an infinite setting, preserving the elementary character of the original theorem. We define voting scenarios and generalized voting scenarios, and prove appropriate versions of May's theorem. The case of generalized voting scenarios specialized to a countably infinite set of voters and the collections of all coalitions that have asymptotic density, shows that majority rule is the only aggregation rule that satisfies neutrality, irrelevance of null coalitions, anonymity, and positive responsiveness.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.:
- Lauwers, Luc, 1998. "Intertemporal objective functions: Strong pareto versus anonymity," Mathematical Social Sciences, Elsevier, vol. 35(1), pages 37-55, January.
- Mark Fey, 2004. "May’s Theorem with an infinite population," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(2), pages 275-293, October.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:1:p:50-55. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.