Computability of simple games: A characterization and application to the core

Autor:	Kumabe, Masahiro, Mihara, H. Reiju
Rok vydání:	2007
Předmět:	Computer Science - Computer Science and Game Theory Computer Science - Computational Complexity Computer Science - Logic in Computer Science Mathematics - Logic F.4.1 F.1.1
Zdroj:	Journal of Mathematical Economics, Volume 44, Issues 3-4, February 2008, Pages 348-366
Druh dokumentu:	Working Paper
DOI:	10.1016/j.jmateco.2007.05.012
Popis:	The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above inclusions are strict. It also extends Nakamura's theorem about the nonemptyness of the core and shows that computable games have a finite Nakamura number, implying that the number of alternatives that the players can deal with rationally is restricted. Comment: 35 pages; To appear in Journal of Mathematical Economics; Appendix added, Propositions, Remarks, etc. are renumbered
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/0705.3227 Zobrazit plný text záznamu View this record from Arxiv