The Shapley value assigns, to each game that is adequately represented by its characteristic function, an outcome for each player. An elaboration on the Shapley value that assigns, to characteristic function games, a "partition function" outcome is broadly established and accepted, but...

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...

It was shown earlier that the class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that...

We present the numbers of ice model configurations (with Boltzmann factors equal to one) I(n) on the two-dimensional Sierpinski gasket SG(n) at stage n. The upper and lower bounds for the entropy per site, defined as limv→∞lnI(n)/v, where v is the number of vertices on SG(n), are derived in...