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 study a generalization of the classical monopoly insurance problem under adverse selection where we allow for a random distribution of losses, possibly correlated with the agent's risk parameter that is private information. Our main purpose is to provide a convenient analytic model that...

We study a generalization of the classical monopoly insurance problem under adverse selection (see Stiglitz [1977]) where we allow for a random distribution of losses, possibly correlated with the agent’s risk parameter that is private information. Our model explains patterns of observed...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...