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

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