We examine the formation of networks among a set of players whose payoffs depend on the structure of the network. We focus on games where players may promise or demand transfer payments when forming links. If players may only make such transfers on the links they are directly involved with, then...

In this paper we study hedonic games where each player views every other player either as a friend or as an enemy. Two simple priority criteria for comparison of coalitions are suggested, and the corresponding preference restrictions based on appreciation of friends and aversion to enemies are...

This paper models individual choices of social groups and the formation of group identity, and examines the conditions with which the group identity reinforces the productivity of individuals. A social group is defined as a network that provides with a market for interactions to its members....

This paper reinterprets the gamma-core (Chander and Tulkens (1995, 1997)) and justifies it as well as its prediction that the efficient coalition structure is stable in terms of the coalition formation theory. It is assumed that coalitions can freely merge or break apart, are farsighted (that...

We investigate game theoretic models of entwork formation that are based on individual actions only. Our approach is grounded in three simple and realistic principles. (1) Link formation should be a binary process of consent. (2) Link formation should be costly. (3) The class of network payoff...

A core allocation of a complete information economy can be characterized as one that would not be unanimously rejected in favor of another feasible alternative by any coalition. We use this test of coalitional voting in an incomplete information environment to formalize a notion of resilience....

We derive an almost non cooperative (ANC) analytical payoff function for all three-agent Aumann-Myerson (1988) games, and tractable ones exist for all three-agent A-M-like network games with any fixed valuation, in contrast to restricted results in the literature, if at all. Unlike link proposal...

We study a repeated Nash demand game, where bargainers follow a fictitious play procedure after their one-shot decision on demand in the initial period. In the reduced static game they play at the initial period, all the epsilon-equilibria are clustered around the division corresponding to the...

The core is extended to games with incomplete information. The feasible set is characterized by incentive-compatible mechanisms, and blocking may similarly be organized by an incentive compatible mediation plan. Nonemptiness is proven for games with a balanced structure

In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed if members of the coalition are connected on...