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

The theory of full implementation has been criticized for using integer/modulo games, which admit no equilibrium (Jackson (1992)). To address the critique, we revisit the classical Nash implementation problem due to Maskin (1977, 1999) but allow for the use of lotteries and monetary transfers as...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

This paper proposes simple axioms that characterize a generalization of backward induction. At any node of a decision tree, the decision maker looks forward a fixed number of stages perfectly. Beyond that, the decision maker aggregates continuation values according to a function that captures...

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 develop a dynamic framework of strategic information transmission through cheap talk in a social network. Privately informed agents have different preferences about the action to be implemented by each agent and repeatedly communicate with their neighbors in the network. We first characterize...

I present a model of observational learning with payoff interdependence. Agents, ordered in a sequence, receive private signals about an uncertain state of the world and sample previous actions. Unlike in standard models of observational learning, an agent's payoff depends both on the state and...

We study the role of communication in repeated games with private monitoring. We first show that without communication, the set of Nash equilibrium payoffs in such games is a subset of the set of ε-coarse correlated equilibrium payoffs (ε-CCE) of the underlying one-shot game. The value of ε...