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

Two sellers decide on their discrete supply of a homogenous good. There is a finite number of buyers with unit demand and privately known valuations. In the first model, there is a centralized market place where a uniform auction takes place. In the second, there are two distinct auction sites,...

We study a model of negotiation and coalition formation concerning a public expenditure and its financing. The agents must determine which coalition will jointly produce a public good, how much will be produced, and how the cost is to be shared. Agents that do not belong to the final coalition...

We study two-sided markets with a finite number of agents on each side, and with two-sided incomplete information. Agents are matched assortatively on the basis of costly signals. Asymmetries in signalling activity between the two sides of the market can be explained by asymmetries either in...

We consider a standard social choice environment with linear utilities and independent, one-dimensional, private types. We prove that for any Bayesian incentive compatible mechanism there exists an equivalent dominant strategy incentive compatible mechanism that delivers the same interim...

We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that...