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 network formation model where agents have heterogeneous knowledge of … the network: cognizant agents know the whole network, while ignorant ones are less knowledgeable. For a broad range of …

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 Folk Theorem extends to this setup, although for a range of … produces a network result; namely, the level of cooperation in this setup depends on the network's diameter, and not on its …

Imperfect private monitoring in an infinitely repeated discounted Prisoner's Dilemma played on a communication network …'s history throughout the network. The delay in receiving this information requires the players to be more patient to sustain the … same level of cooperation as in a complete network, although a Folk Theorem obtains when the players are patient enough …

We introduce a noncooperative multilateral bargaining model for a network-restricted environment, in which players can … their communication links with upfront transfers. The main theorem characterizes a condition on network structures for … efficient equilibria and shows the prevalence of strategic delays. If the underlying network is either complete or circular …

Most literature in strategic network formation shows that there is a substantial tension between stability and … (2000a) and De Jaegher and Kamphorst (2015). Specifically, I show that every link receiver in a Nash network serves as an …

In this paper, we show that a concept of aggregation can hold in large network games with linear best replies. Breaking … compute all Nash equilibria for the special network structure of cograph. A key finding is that a stable Nash equilibrium of … the large network game can be decomposed into a collection of Nash equilibria of subnetwork games. Thereby, we establish a …

This paper proposes new centrality measures to characterise the 'key class', when agents in a network are sorted into … role-equivalent classes, such that its removal results in an optimal change in the network activity. The notion of role … theoretical applicability. Players in the network engage in a non-cooperative game with local payoff complementarities. We …

default game. Furthermore, we develop an algorithm to find all Nash equilibria that relies on the financial network structure …

the nodes receive through the network. First, assuming that links are the result of investments by the node …