We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents whose private information remains fixed throughout time; and those with a fixed population of agents whose private information changes...

We analyze the optimal design of dynamic mechanisms in the absence of transfers. The designer uses future allocation decisions as a way of eliciting private information. Values evolve according to a two-state Markov chain. We solve for the optimal allocation rule, which admits a simple...

We study a canonical model of reputation between a long-run player and a sequence of short-run opponents, in which the long-run player is privately informed about an uncertain state that determines the monitoring structure in the reputation game. The long-run player plays a stage-game repeatedly...

Reputation concerns can discipline agents to take costly effort and generate good outcomes. But what if outcomes are not always observed? We consider a model of reputation with shifting observability, and ask how this affects agents' incentives. We identify a novel and intuitive mechanism by...

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private...

This paper examines the welfare effects of informational intermediation. A (shortlived) seller sets the price of a product that is sold through a (long-lived) informational intermediary. The intermediary can disclose information about the product to consumers, earns a fixed percentage of the...

We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with...

We analyze games of incomplete information and offer equilibrium predictions which are valid for all possible private information structures that the agents may have. Our characterization of these robust predictions relies on an epistemic result which establishes a relationship between the set...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...