We characterize a class of dynamic stochastic games that we call separable dynamic games with noisy transitions and establish that these widely used models are protocol invariant provided that periods are sufficiently short. Protocol invariance means that the set of Markov perfect equilibria is...

Learning is crucial to organizational decision making but often needs to be delegated. We examine a dynamic delegation problem where a principal decides on a project with uncertain profitability. A biased agent, who is initially as uninformed as the principal, privately learns the profitability...

This paper studies the problem of self governance in a model in which information flows are governed by the community structure. In each round of an infinitely repeated game, an agent and an investor, who is selected from a finite set of investors, play a trust game. Investors receive...

We study repeated Bayesian n-player games in which the players' privately known types evolve according an irreducible Markov chain. Our main result shows that, with communication, any Pareto-efficient payoff vector above a stationary minmax value can be approximated arbitrarily closely in a...

We study a class of repeated games with Markovian private information and characterize optimal equilibria as players become arbitrarily patient.  We show that seemingly non-cooperative action may occur in equilibrium and serve as signals of changes in private information. Players forgive such...

This paper develops a theory of regular 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 that are all regular. These equilibria are essential and strongly stable. Moreover,...