When a strategic situation arises repeatedly, the possibility arises that equilibrium predictions can be justified by a dynamic adjustment process. We examine myopic adjustment dynamics, a class that includes replicator dynamics from evolutionary game theory, simple models of imitation, models...

Using techniques from evolutionary game theory, we analyze potential games with continuous player sets, a class of games which includes a general model of network congestion as a special case. We concisely characterize both the complete set of Nash equilibria and the set of equilibria which are...

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public...

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

Many conditions have been introduced to weaken the continuity re- quirements for equilibrium existence in games. We introduce a new con- dition, called regularity, that is simple and easy to verify. It is implied both by Reny's better-reply security and Simon and Zame's endogenous sharing rule...

We investigate the scope for cooperation within a community engaged in repeated reciprocal interactions. Players seek the help of others and approach them sequentially according to some fixed order, that is, a ranking profile. We study the ranking profiles that are most effective in sustaining...

This is a draft of a chapter for a book called "Game Theory, 5 Questions," to be published by Automatic Pressed/VIP.Below are five questions and my answers. Any feedback is appreciated.

I study the properties of optimal long-term contracts in an environment in which the agent’s type evolves stochastically over time. The model stylizes a buyer-seller relationship but the results apply quite naturally to many contractual situations including regulation and optimal...

These notes examine the problem of how to extend envelope theorems to infinite-horizon dynamic mechanism design settings, with an application to the design of "bandit auctions."

We examine the design of incentive-compatible screening mechanisms for dynamic environments in which the agents types follow a (possibly non-Markov) stochastic process, decisions may be made over time and may affect the type process, and payoffs need not be time-separable. We derive a formula...