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.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006. "Computability of simple games: A complete investigation of the sixty-four possibilities," MPRA Paper 440, University Library of Munich, Germany.
- H. Reiju Mihara, 2003.
"Nonanonymity and sensitivity of computable simple games,"
Game Theory and Information, EconWPA
0310006, EconWPA, revised 01 Jun 2004.
- Mihara, H. Reiju, 2004. "Nonanonymity and sensitivity of computable simple games," Mathematical Social Sciences, Elsevier, Elsevier, vol. 48(3), pages 329-341, November.
- 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: (Zhang, Lei).
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.