Computability of simple games: A complete investigation of the sixty-four possibilities

Autor:	Kumabe, Masahiro, Mihara, H. Reiju
Rok vydání:	2011
Předmět:	Computer Science - Computer Science and Game Theory Computer Science - Logic in Computer Science Mathematics - Logic 91A12 91A13 F.4.1 F.1.1
Zdroj:	Journal of Mathematical Economics 47 (2011) 150-158
Druh dokumentu:	Working Paper
DOI:	10.1016/j.jmateco.2010.12.003
Popis:	Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class, we either show that it is empty or give an example of a game belonging to it. We observe that if a type contains an infinite game, then it contains both computable ones and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axioms. Comment: 25 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1102.4037 Zobrazit plný text záznamu View this record from Arxiv