We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

We consider a model of the world with several regions that may create a unified entity or be partitioned into several unions (countries). The regions have distinct preferences over policies chosen in the country to which they belong and equally share the cost of public policies. It is known that...

Given a simple game, a power configuration specifies the power of each player in each winning coalition. We introduce a new power configuration which takes into account bargaining among players in coalitions. We show that under very weak conditions on a bargaining solution there is a power...

Rotation programs are widely used in societies. Some examples are job rotations, rotation schemes in the management of common-pool resources, and rotation procedures in fair division problems. We study rotation programs via the implementation of Pareto efficient social choice rules under...

While most of the literature starting with Shapley and Scarf (1974) have considered a static exchange economy with indivisibilities, this paper studies the dynamics of such an economy. We find that both the dynamics generated by competitive equilibrium and the one generated by weakly dominance...

The relevance of bargaining to everyday life can easily be ascertained, yet the study of any bargaining process is extremely hard, involving a multiplicity of questions and complex issues. The objective of this paper is to provide new insights on some dimensions of the bargaining process -...

We consider a standard coalitional bargaining game where once a coalition forms it exits as in Okada (2011), however, instead of alternating offers, we have simultaneous payoff demands. We focus in the producer game he studies. Each player is chosen with equal probability. If that is the case,...

The paper considers a one-to-one matching with contracts model in the presence of price controls. This set-up contains two important streams in the matching literature, those with and those without monetary transfers, as special cases and allows for intermediate cases with some restrictions on...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...