Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras
AbstractIn the very general setting of Armstrong (1980) for Arrow's Theorem, I show two results. First, in an infinite society, Anonymity is inconsistent with Unanimity and Independence if and only if a domain for social welfare functions satisfies a modest condition of richness. While Arrow's axioms can be satisfied, unequal treatment of individuals thus persists. Second, Neutrality is consistent with Unanimity (and Independence). However, there are both dictatorial and nondictatorial social welfare functions satisfying Unanimity and Independence but not Neutrality. In Armstrong's setting, one can naturally view Neutrality as a stronger condition of informational simplicity than Independence.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 14 (1997)
Issue (Month): 4 ()
Note: Received: 11 August 1994/Accepted: 1 April 1996
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
Other versions of this item:
- H. Reiju Mihara, 1994. "Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras," Public Economics 9411001, EconWPA, revised 22 Nov 1994.
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- H. Reiju Mihara, 2003.
"Nonanonymity and sensitivity of computable simple games,"
Game Theory and Information
0310006, EconWPA, revised 01 Jun 2004.
- Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, vol. 48(3), pages 329-341, November.
- Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002.
"Anonymity in Large Societies,"
0211, Centro de Investigacion Economica, ITAM.
- H. Reiju Mihara, 1997.
"Arrow's Theorem and Turing computability,"
Springer, vol. 10(2), pages 257-276.
- Ricard Torres, 2002. "Smallness of Invisible Dictators," Working Papers 0213, Centro de Investigacion Economica, ITAM, revised Sep 2003.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.