Arrow's theorem, countably many agents, and more visible invisible dictators1
AbstractNo abstract is available for this item.
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 Elsevier in its journal Journal of Mathematical Economics.
Volume (Year): 32 (1999)
Issue (Month): 3 (November)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006.
"Computability of simple games: A complete investigation of the sixty-four possibilities,"
440, University Library of Munich, Germany.
- Kumabe, Masahiro & Mihara, H. Reiju, 2011. "Computability of simple games: A complete investigation of the sixty-four possibilities," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 150-158, March.
- Mabrouk, Mohamed, 2006. "Allais-anonymity as an alternative to the discounted-sum criterion in the calculus of optimal growth I: Consensual optimality," MPRA Paper 10512, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.