We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We consider dynamic team production in the presence of uncertainty. Team members receive interim feedback that depends on both their current effort level and the project's uncertain prospects. In this environment, each member can encourage the others by making them more optimistic about the...

In this paper, I provide a characterization of a \textit{set} of probability measures with which a prior ``weakly merges.'' In this regard, I introduce the concept of ``conditioning rules'' that represent the \textit{regularities% } of probability measures and define the ``eventual generation''...

This paper studies generic properties of Markov perfect equilibria in dynamic stochastic games. We show that almost all dynamic stochastic games have a finite number of locally isolated Markov perfect equilibria. These equilibria are essential and strongly stable. Moreover, they all admit...

We study repeated games in which players learn the unknown state of the world by observing a sequence of noisy private signals. We find that for generic signal distributions, the folk theorem obtains using ex-post equilibria. In our equilibria, players commonly learn the state, that is, the...

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in...

This paper studies an infinite horizon repeated moral hazard problem where a single principal employs several agents. We assume that the principal cannot observe the agents' effort choices; however, agents can observe each other and can be contractually required to make observation reports to...

Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

We analyze the social and private learning at the symmetric equilibria of a queueing game with strategic experimentation. An infinite sequence of agents arrive at a server which processes them at an unknown rate. The number of agents served at each date is either: a geometric random variable in...