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

Government procurement and allocation programs often use subsidies and set-asides favoring small businesses and other target groups to address fairness concerns. These concerns are in addition to standard objectives such as efficiency and revenue. We study the design of the optimal mechanism for...

“Those who claim for themselves to judge the truth are bound to possess a criterion of truth.” JEL Code: C18, C53, D89

We study a seller's optimal mechanism for maximizing revenue when the buyer may present evidence relevant to the buyer's value, or when different types of buyer have a differential ability to communicate. We introduce a dynamic bargaining protocol in which the buyer first makes a sequence of...

The property of an allocation rule to be implementable in dominant strategies by a unique payment scheme is called revenue equivalence. In this paper we give a characterization of revenue equivalence based on a graph theoretic interpretation of the incentive compatibility constraints. The...