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.
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.
- Andrei Gomberg & César Martinelli & Ricard Torres, 2005.
"Anonymity in large societies,"
Social Choice and Welfare,
Springer, vol. 25(1), pages 187-205, October.
- Mihara, H. Reiju, 2004.
"Nonanonymity and sensitivity of computable simple games,"
Mathematical Social Sciences,
Elsevier, vol. 48(3), pages 329-341, November.
- H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
- Norbert Brunner & H. Reiju Mihara, 1999. "Arrow's theorem, Weglorz' models and the axiom of choice," Public Economics 9902001, EconWPA, revised 01 Jun 2004.
- H. Reiju Mihara, 1994.
"Arrow's Theorem and Turing Computability,"
9408001, EconWPA, revised 23 Aug 1994.
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 references are entirely missing, you can add them using this form.