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 discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or of their equilibrium play are made. Because of this, equilibria will...

We study an infinitely-repeated ?rst-price auction with common values. Initially, bid- ders receive independent private signals about the objects' value, which itself does not change over time. Learning occurs only through observation of the bids. Under one-sided incomplete information, this...

We study all-pay auctions (or wars of attrition), where the highest bidder wins an object, but all bidders pay their bids. We consider such auctions when two bidders alternate in raising their bids and where all aspects of the auction are common knowledge including bidders' valuations. We...

Affiliation has been a prominent assumption in the study of economic models with statistical dependence. Despite its large number of applications, especially in auction theory, affiliation has limitations that are important to be aware of. This paper shows that affiliation is a restrictive...

This paper illustrates the intricacies associated with the design of revenue-maximizing mechanisms for a monopolist who expects her buyers to resell in a secondary market. We consider two modes of resale: the first is to a third party who does not participate in the primary market; the second is...

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

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

We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption may be unknown to that agent. The problem is motivated by keyword...

This paper examines the intricacies associated with the design of revenue-maximizing mechanisms for a monopolist who expects her buyers to resell. We consider two cases: resale to a third party who does not participate in the primary market and inter-bidder resale, where the winner resells to...