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 revisit the idea that robustness concerns can provide a foundation for simple mechanisms. Formally, we consider the robust implementation notion of continuous implementation (Oury and Tercieux, 2012), where continuity is with respect to players' hierarchy of beliefs. We define simplicity as...

Many auctions involve the sale of heterogenous indivisible objects. Examples are wireless spectrum, delivery routes and airport time slots. Because of complementarities or substitution effects between the objects, bidders have preferences not just over individual items but over subsets of them....