In the game of rock-paper-scissors with three players, this paper identifies conditions for a correlated equilibrium that differs from the mixed strategy Nash equilibrium and is evolutionarily stable. For this to occur, the correlation device attaches more probability to three-way ties and...

I consider a class of dynamic Bayesian games in which types evolve stochastically according to a first-order Markov process on a continuous type space. Types are privately informed, but they become public together with actions when payoffs are obtained, resulting in a delayed information...

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through wage offers and wage demands, firms compete over workers and workers compete over jobs. Firms make hire-and-fire decisions dependent on the wages of their own workers and on the...

This paper reconsiders evidence from experimental common pool resource games from the perspective of a model of payoff sampling. Despite being parameter-free, the model is able to replicate some striking features of the data, including single-peaked frequency distributions, the persistent use of...

This paper examines how to construct subgame-perfect mixed-strategy equilibria in discounted repeated games with perfect monitoring. We introduce a relatively simple class of strategy profiles that are easy to compute and may give rise to a large set of equilibrium payoffs. These sets are called...

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

Counterfactual policy evaluation often requires computation of game‐theoretic equilibria. We provide new algorithms for computing pure‐strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that...

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