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 show that a non-Bayesian learning procedure leads to very permissive implementation results concerning the efficient allocation of resources in a dynamic environment where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of...

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 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 consider a standard social choice environment with linear utility and one-dimensional types. We show by counterexample that, when there are at least three physical alternatives, Bayes-Nash Incentive Compatibility (BIC) and Dominant Strategy Incentive Compatibility (DIC) need no longer be...

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

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

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