In a simple game, coalitions belonging to a given class are supposed to be "absolutely powerful" while others have no power. We attempt to make this distinction operational. Toward this end, we propose two axioms, Exclusion and Strong Non-Discrimination. Strong Non-Discrimination describes...

This paper examines coalition formation problems from the viewpoint of mechanism design. We consider the case where (i) the list of feasible coalitions (those coalitions which are permitted to form) is given in advance; and (ii) each individual’s preference is a ranking over those feasible...

This note considers the equilibrium outcomes of the preference revelation games in the general model of indivisible good allocation introduced by [Sönmez, T., 1999. Strategy-proofness and essentially single-valued cores. Econometrica 67, 677-689]. We adopt the concepts of coalitional equilibria...

In a general model of indivisible good allocation, Sönmez (1999) established that, whenever the core is nonempty for each preference profile, if an allocation rule is strategy-proof, individually rational and Pareto optimal, then the rule is a selection from the core correspondence, and the...

This paper examines the -core of strategic games by means of the consistency principle. I provide a new definition of a reduced game for strategic games. And I define consistency (CONS) and two forms of converse consistency (COCONS and COCONS*) under this definition of reduced games. Then I...

In the marriage problem (two-sided one-to-one matching problem), it is well-known that the weak core, the strong core and the set of stable matchings are all equivalent. This paper generalizes the above observation considering the G-weak core and the G-strong core. These are core concepts in...