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.

This paper examines the problem of how to design incentive-compatible mechanisms in environments in which the agents' private information evolves stochastically over time and in which decisions have to be made in each period. The environments we consider are fairly general in that the agents'...

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." -- Asymmetric information ; stochastic processes ; incentives ; mechanism design

We characterize the optimal incentive scheme for a manager who faces costly effort decisions and whose ability to generate profits for the fim varies stochastically over time. The optimal contract is obtained as the solution to a dynamic mechanism design problem with hidden actions and...

This paper studies second-degree price discrimination in matching markets, that is, in markets where the product sold by the monopolist is access to other agents. In order to investigate the optimality of a large variety of pricing strategies, we allow for any many-to-many matching rule that...

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