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

We consider a make-to-order supply chain where a retailer sells a product for a manufacturer. There is a single selling season, during which the retailer receives customer orders and then sends the orders to the manufacturer for fulfillment. The manufacturer privately exerts effort to install...