sufficient conditions for the efficient allocation to be implementable, and we draw a parallel to situations with direct informational externalities.

We study dominant strategy incentive compatible (DIC) and deterministic mechanisms in a social choice setting with several alternatives. The agents are privately informed about their preferences, and have single-crossing utility functions. Monetary transfers are not feasible. We use an...

We consider the standard mechanism design environment with linear utility but without monetary transfers. We first establish an equivalence between deterministic, dominant strategy incentive compatible mechanisms and generalized median voter schemes. We then use this equivalence to construct the...

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

This paper illustrates the benefits of applying mechanism design techniques to questions in revenue management, in particular to dynamic allocation and pricing problems. It is demonstrated that the solution to a sequential stochastic assignment problem under complete information can also be...

We study the revenue-maximizing allocation of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially. There is a deadline after which no more objects can be allocated. We first characterize implementable allocation schemes,...

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