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

@article{Kumabe2011ComputabilityOS,
  title={Computability of simple games: A complete investigation of the sixty-four possibilities},
  author={Masahiro Kumabe and H. Reiju Mihara},
  journal={CoRR},
  year={2011},
  volume={abs/1102.4037}
}
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… CONTINUE READING