We study an allocation problem where a set of objects needs to be allocated to agents arriving over time. The basic model is of the private, independent values type. The dynamically efficient allocation is implementable if the distribution of agents' values is known. Whereas lack of knowledge...

We study a contest with multiple, nonidentical prizes. Participants are privately informed about a parameter (ability) affecting their costs of effort. The contestant with the highest effort wins the first prize, the contestant with the second-highest effort wins the second prize, and so on...

The authors consider situations where a sale affects the ensuing interaction between potential buyers. These situations are modeled by assuming that an agent who does not acquire the object for sale incurs an identity-dependent externality. The authors construct a revenue-maximizing auction for...