Gale and Shapley (1962) proposed the deferred-acceptance algorithm for matching (i) college applicants and colleges and (ii) men and women. In the case of the latter, it produces either one or two stable matches whereby no man and woman would prefer to be matched with each other rather than with...

The Median Voter Theorem is an extremely popular result in Political Economy that holds only if the policy space is unidimensional. This assumption restricts its use to a class of very simple problems. In most applications in the literature this implied an oversimplification of the problem...

An allocation of indivisible items among n ≥ 2 players is proportional if and only if each player receives a proportional subset—one that it thinks is worth at least 1/n of the total value of all the items. We show that a proportional allocation exists if and only if there is an allocation...

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 paper discusses opportunities to utilize the series of micro-blogs as provided by the Twitter in observation of opinion dynamics. The spontaneity of tweets is more, as the service is attached more to the mobile communications. The extraction of information in the series of tweets is...

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

In Hart and Kurz (1983), stability and formation of coalition structures has been investigated in a noncooperative framework in which the strategy of each player is the coalition he wishes to join. However, given a strategy profile, the coalition structure formed is not unequivocally determined....

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