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 consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project's cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects - both which and how many - is endogenously...

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. Projects may differ in their value for the designer, and their cost is private information. In this allocation problem, the quantity of procured projects is endogenously determined...

We consider a budget-constrained mechanism designer who selects an optimal set of projects to maximize her utility. A project's cost is private information and its value for the designer may vary. In this allocation problem, the selection of projects - both which and how many - is endogenously...