This paper extends the theory of endogenous coalition formation, with complete information and transferable utility, to the overlapping case. We propose a cover function bargaining game which allows the formation of overlapping coalitions at equilibrium. We show the existence of subgame perfect...

We introduce a noncooperative multilateral bargaining model for a network-restricted environment, in which players can communicate only with their neighbors. Each player strategically chooses the bargaining partners among the neighbors to buy out their communication links with upfront transfers....

A local public-good game played on directed networks is analyzed. The model is motivated by one-way flows of hydrological influence between cities of a river basin that may shape the level of their contribution to the conservation of wetlands. It is shown that in many (but not all) directed...

We study (anti-) coordination problems in networks in a laboratory experiment. Participants interact with their neighbours in a fixed network to play a bilateral (anti-) coordination game. Our main treatment variable is the extent to which players are heterogeneous in the number of connections...

Many social networks have the following properties: (i) a short average distance between any two individuals; (ii) a high clustering coefficient; (iii) segregation patterns; the presence of (iv) brokers and (v) hubs. (i) and (ii) define a small world network. This paper develops a strategic...

Suppose markets and firms are connected in a bi-partite network, where firms can only supply to the markets they are connected to. Firms compete a la Cournot and decide how much to supply to each market they have a link with. We assume that markets have linear demand functions and firms have...

A tragedy of the commons appears when the users of a common resource have incentives to exploit it more than the socially efficient level. We analyze the situation when the tragedy of the commons is embedded in a network of users and sources. Users play a game of extractions, where they decide...

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

Bi and branching networks are two classes of minimal networks often found in the literatures of two-way flow Strict Nash networks. Why so? In this paper, we answer this question by establishing a generalized condition that holds together many models in the literature, and then show that this...