May 22, 2007 · This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing ...

This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above ...

Jul 15, 2011 · This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing ...

Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4) ...

Sep 29, 2019 · This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing ...

Abstract. It was shown earlier that the class of algorithmically computable simple games (i) includes the class of games that have finite carriers.

Abstract. The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the.

This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above ...

Classify simple games into sixteen “types” in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness.

This paper characterizes computable games, strengthens the earlier result that computable games violate anonymity, and gives examples showing that the above ...