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

Masahiro Kumabe and H. Reiju Mihara

MPRA Paper from University Library of Munich, Germany

Abstract: 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 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 infinitegames and noncomputable ones. This strongly suggests that computability is logically, as well as conceptually, unrelated to the conventional axioms.

Keywords: Voting games; infinitely many players; axiomatic method; complete independence; algorithms; Turing computability; recursion theory (search for similar items in EconPapers)
JEL-codes: C69 C71 D71 D90 (search for similar items in EconPapers)
Date: 2006-10
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/440/1/MPRA_paper_440.pdf original version (application/pdf)
https://mpra.ub.uni-muenchen.de/4405/1/MPRA_paper_4405.pdf revised version (application/pdf)
https://mpra.ub.uni-muenchen.de/29000/1/MPRA_paper_29000.pdf revised version (application/pdf)

Related works:
Journal Article: Computability of simple games: A complete investigation of the sixty-four possibilities (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:440

Access Statistics for this paper

More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().