We study multi-object auctions where agents have private and additive valuations for heterogeneous objects. We focus on the revenue properties of a class of dominant strategy mechanisms where a weight is assigned to each partition of objects. The weights influence the probability with which...

We study the allocation of several heterogenous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. We analyze and compare the policies that maximize either welfare or revenue. We focus on two cases:...

We study the effects of allocative and informational externalities in (multi-object) auctions and related mechanisms. Such externalities naturally arise in models that embed auctions in larger economic contexts. In particular, they appear when there is downstream interaction among bidders after...

Europe has taken the global lead in the issuance of third generation (3G) licences for mobile telecommunications according to the UMTS/IMT-2000 family of standards. We survey the recent European UMTS licence auctions and compare their outcomes with the predictions of a simple auction model that...

We study two-sided markets with heterogeneous, privately informed agents who gain from being matched with better partners from the other side. Agents are matched through an intermediary. Our main results quantify the relative attractiveness of a coarse matching scheme consisting of two classes...

We study the welfare maximizing assignment of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. There is a deadline after which no more objects can be allocated. We first show...

We study optimal contest design in situations where the designer can reward high performance agents with positive prizes and punish low performance agents with negative prizes. We link the optimal prize structure to the curvature of distribution of abilities in the population. In particular, we...

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 analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay...

We characterize the incentive compatible, constrained efficient policy ("second-best") in a dynamic matching environment, where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of agents' values. We also derive conditions on...