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.

Under full substitutability of preferences, it has been shown that a competitive equilibrium exists in trading networks, and is equivalent (after a restriction to equilibrium trades) to (chain) stable outcomes. In this paper, we formulate the problem of finding an efficient outcome as a...

We study a seller's optimal mechanism for maximizing revenue when a buyer may present evidence relevant to her value. We show that a condition very close to transparency of buyer segments is necessary and sufficient for the optimal mechanism to be deterministic--hence akin to classic third...

This paper highlights connections between the discrete and continuous approaches to optimal auction design with single and multi-dimensional types. We provide an interpretaion of an optimal auction design problem in terms of a linear program that is an instance of a parametric shortest path...

This paper provides a characterization of dominant strategy mechanisms with quasi-linear utilities and multi-dimensional types for a variety of preference domains. These characterizations are in terms of a monotonicity property on the underlying allocation rule.

We consider an environment with a single divisible good and two bidders. The valuations of the bidders are private information but one bidder has a commonly known budget constraint. For this environment we derive the revenue maximizing subsidy free incentive compatible auction. We also examine...

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

We consider an environment where potential buyers of an indivisible good have liquidity constraints, in that they cannot pay more than their `budget' regardless of their valuation. A buyer's valuation for the good as well as her budget are her private information. We derive constrained-e±cient...