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

The equivalence of markets and games concerns the relationship between two sorts of structures that appear fundamentally different -- markets and games. Shapley and Shubik (1969) demonstrates that: (1) games derived from markets with concave utility functions generate totally balanced games...

In this paper, we study the long-played, yet until now unmodeled, college admissions game over early admissions plans using a many-to-one matching framework. We characterize the equilibrium strategies of each college involving its early quota out of its total capacity, and the set of admissible...

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple...

The application of game theory and cognitive economy to analyze the problem of undesired location - The analysts of the processes of public bodies decision - taking have long been discussing on the establishment of proper strategies to manage "environmental conflicts" - above all the so-called...

We study political distortions that emerge in situations where agents’ political power is disproportionate with respect to their economic power. We use the Shapley value to evaluate both the economic and the political power. We show that usual weighted majority voting cannot prevent political...

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

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

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 computable games violate...

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