A key obstacle to coordination and cooperation in many networked environments is that behavior in each bilateral relationship is not observable to individuals outside that relationship: that is, information is local. This paper investigates when players can use communication to replicate any...

We study the information flows that arise among a set of agents with local knowledge and directed payoff interactions, which differ among pairs of agents. First, we study the equilibrium of a game where, before making decisions, agents can invest in pairwise active communication (speaking) and...

We develop a dynamic network formation model that can explain the observed nestedness in real-world networks. Links are formed on the basis of agents' centrality and have an exponentially distributed life time. We use stochastic stability to identify the networks to which the network formation...

This paper provides a formal characterization of the process of rational learning in social networks. Agents receive initial private information and select an action out of a choice set under uncertainty in each of infinitely many periods, observing the history of choices of their neighbors....

This paper develops a simple model in which a social hierarchy emerges endogenously when agents form a network for complementary interaction (``activity''). Specifically, we assume that agents are ex ante identical and their best response activity, as well as their value function, increases...

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An \textit{underlying state} determines payoffs from different actions. Agents decide which others to form a costly \textit{communication link} with,...

The paper discusses community enforcement in infinitely repeated, two-action games with local interaction and uncertain monitoring. Each player interacts with and observes only a fixed set of opponents, of whom he is privately informed. The main result shows that when beliefs about the...

We address the problem of a planner looking for the efficient network when agents play a network game with local complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of Nested-Split Graphs. Next, we refine our results and...

This paper provides a formal characterization of the process of rational learning in social networks. Agents receive initial private information and select an action out of a choice set under uncertainty in each of infinitely many periods, observing the history of choices of their neighbors....

We develop a model of information exchange through communication and investigate its implications for information aggregation in large societies. An \textit{underlying state} determines payoffs from different actions. Agents decide which others to form a costly \textit{communication link} with,...