This paper studies a dynamic adjustment process in a large society of forward-looking agents where payoffs are given by a normal form supermodular game. The stationary states of the dynamics correspond to the Nash equilibria of the stage game. It is shown that if the stage game has a monotone...

We study two-player discounted repeated games in which one player cannot monitor the other unless he pays a fixed amount. It is well known that in such a model the folk theorem holds when the monitoring cost is on the order of magnitude of the stage payoff. We analyze high frequency games in...

Harris, Reny, and Robson (1995) added a public randomization device to dynamic games with almost perfect information to ensure existence of subgame perfect equilibria (SPE). We show that when Nature's moves are atomless in the original game, public randomization does not enlarge the set of SPE...

This paper aims to solve two fundamental problems on finite or infinite horizon dynamic games with complete information. Under some mild conditions, we prove the existence of subgame-perfect equilibria and the upper hemicontinuity of equilibrium payoffs in general dynamic games with simultaneous...

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

Dynamic policy games feature a wide range of equilibria. This paper provides a methodology for obtaining robust predictions. We focus on a model of sovereign debt, although our methodology applies to other settings, such as models of monetary policy or capital taxation. Our main result is a...

We present a new approach to studying equilibrium dynamics in a class of stochastic games with a continuum of players with private types and strategic complementarities. We introduce a suitable equilibrium concept, called Markov Stationary Nash Distributional Equilibrium (MSNDE), prove its...

We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

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

I prove an efficiency result for repeated games with imperfect public monitoring in which one player's utility is privately known and evolves according to a Markov process. Under certain assumptions, patient players can attain approximately efficient payoffs in equilibrium. The public signal...