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

We illustrate one way in which a population of boundedly rational individuals can learn to play an approximate Nash equilibrium. Players are assumed to make strategy choices using a combination of imitation and innovation. We begin by looking at an imitation dynamic and provide conditions under...

Imperfect private monitoring in an infinitely repeated discounted Prisoner's Dilemma played on a communication network is studied. Players observe their direct neighbors' behavior only, but communicate strategically the repeated game's history throughout the network. The delay in receiving this...

We generalise the coalition structure core to partition function games. Our definition relies only on one crucial assumption, namely that there is some internal consistency in the game: residuals of the deviation play a game similar to the initial one, and – whenever this is possible – they...

Community enforcement is an important device for sustaining efficiency in some repeated games of cooperation. We investigate cooperation when information about players' reputations spreads to their future partners through links in a social network that connects them. We find that information...

This paper proposes a model of multilateral contracting where players are engaged in two parallel interactions: they dynamically form coalitions and play a repeated normal form game with temporary and permanent decisions. This formulation encompasses many economic models with externalities and...

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 bargain by promising or demanding transfer payments when forming links. We examine several variations of the transfer/bargaining aspect of link...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

We adopt the largest consistent set defined by Chwe [J. of Econ. Theory 63 (1994), 299-235] to predict which coalition structures are possibly stable when players are farsighted. We also introduce a refinement, the largest cautious consistent set, based on the assumption that players are...