Logo
Munich Personal RePEc Archive

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

Kumabe, Masahiro and Mihara, H. Reiju (2007): Computability of simple games: A complete investigation of the sixty-four possibilities.

Warning
There is a more recent version of this item available.
[thumbnail of MPRA_paper_4405.pdf]
Preview
PDF
MPRA_paper_4405.pdf

Download (261kB) | Preview

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

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.