An infinite version of arrow's theorem in the effective setting
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 Mathematical Social Sciences.
Volume (Year): 16 (1988)
Issue (Month): 1 (August)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
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, 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.
- Masahiro Kumabe & H. Reiju Mihara, 2008.
"The Nakamura numbers for computable simple games,"
Social Choice and Welfare,
Springer, vol. 31(4), pages 621-640, December.
- H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.
- Mihara, H.R., 1994.
"Arrow's Theorem and Turing Computability,"
276, Minnesota - Center for Economic Research.
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.