We generalize the standard, private values voting model with single-peaked preferences and incomplete information by introducing interdependent preferences. Our main results show how standard mechanisms that are outcome-equivalent and implement the Condorcet winner under complete information or...

We use the tools of mechanism design, combined with the theory of risk measures, to analyze a model where a cash constrained owner of an asset with stochastic returns raises capital from a population of investors that di¤er in their risk aversion and budget constraints. The distribution of the...

We generalize the standard, private values voting model with single-peaked preferences and incomplete information by introducing interdependent preferences. Our main results show how standard mechanisms that are outcome-equivalent and implement the Condorcet winner under complete information or...

We analyze dynamic allocations in a model with uncertain demand and with unobservable arrivals. The planner learns along the way about future demand, but strategic agents, who anticipate this behavior, strategically choose the timing of their arrivals. We examine the conditions under which the...

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

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