Nonanonymity and sensitivity of computable simple games
AbstractThis paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anonymity, including finite anonymity and measurebased anonymity. The paper argues that computable games are excluded from the intuitive class of gniceh infinite games, employing the notion of ginsensitivityh\-equal treatment of any two coalitions that differ only on a finite set.
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): 48 (2004)
Issue (Month): 3 (November)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Other versions of this item:
- H. Reiju Mihara, 2003. "Nonanonymity and sensitivity of computable simple games," Game Theory and Information 0310006, EconWPA, revised 01 Jun 2004.
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- C69 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Other
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Banks, Jeffrey & Duggan, John & Le Breton, Michel, 2003.
"Social Choice and Electoral Competition in the General Spatial Model,"
IDEI Working Papers
188, Institut d'Économie Industrielle (IDEI), Toulouse.
- Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2006. "Social choice and electoral competition in the general spatial model," Journal of Economic Theory, Elsevier, vol. 126(1), pages 194-234, January.
- H. Reiju Mihara, 1994.
"Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras,"
9411001, EconWPA, revised 22 Nov 1994.
- H. Reiju Mihara, 1997. "Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras," Social Choice and Welfare, Springer, vol. 14(4), pages 503-512.
- Mihara, H.R., 1994.
"Arrow's Theorem and Turing Computability,"
276, Minnesota - Center for Economic Research.
- Kirman, Alan P. & Sondermann, Dieter, 1972.
"Arrow's theorem, many agents, and invisible dictators,"
Journal of Economic Theory,
Elsevier, vol. 5(2), pages 267-277, October.
- KIRMAN, Alan P. & SONDERMANN, Dieter, . "Arrow's theorem, many agents, and indivisible dictators," CORE Discussion Papers RP -118, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Armstrong, Thomas E., 1985. "Precisely dictatorial social welfare functions : Erratum and Addendum to `arrows theorem with restricted coalition algebras'," Journal of Mathematical Economics, Elsevier, vol. 14(1), pages 57-59, February.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002.
"Anonymity in Large Societies,"
0211, Centro de Investigacion Economica, ITAM.
- Armstrong, Thomas E., 1980. "Arrow's theorem with restricted coalition algebras," Journal of Mathematical Economics, Elsevier, vol. 7(1), pages 55-75, March.
- Weber, Robert J., 1994. "Games in coalitional form," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 36, pages 1285-1303 Elsevier.
- Mihara, H. Reiju, 1999. "Arrow's theorem, countably many agents, and more visible invisible dictators1," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 267-287, November.
- H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.
- 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.
- Kumabe, Masahiro & Mihara, H. Reiju, 2006.
"Computability of simple games: A characterization and application to the core,"
437, University Library of Munich, Germany.
- Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
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.