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

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

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

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

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

This paper develops a framework for studying repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers) in every period. I define history-dependent and...

We study large-population repeated games where players are symmetric but not anonymous, so player-specific rewards and punishments are feasible. Players may be commitment types who always take the same action. Even though players are not anonymous, we show that an anti-folk theorem holds when...

We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff...

We study impersonal exchange, and ask how agents can behave honestly in anonymous transactions without contracts. We analyze repeated anonymous random matching games, where agents observe only their own transactions. Little is known about cooperation in this setting beyond the prisoner's...