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

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