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 provide a technique for constructing optimal multiattribute screening contracts in a general setting with one-dimensional types based on necessary optimality conditions. Our approach allows for type-dependent participation constraints and arbitrary risk profiles. As an example we discuss...