The Stochastic and Dynamic Knapsack Model
The Stochastic and Dynamic Knapsack Model
In this chapter the authors characterize the revenue maximizing policy 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 per unit of capacity. Types are private information. The authors first characterize implementable policies. Then they solve the revenue maximization problem for the special case where there is private information about per-unit values, but weights are observable. After that they derive two sets of additional conditions on the joint distribution of values and weights under which the revenue maximizing policy for the case with observable weights is implementable, and thus optimal also for the case with two-dimensional private information. Finally, the authors analyze a simple policy for which per-unit prices vary with requested weight but do not vary with time. Its implementation requirements are similar to those of the optimal policy and it turns out to be asymptotically revenue maximizing when available capacity/ time to the deadline both go to infinity.
Keywords: Revenue maximization, Knapsack, multi-dimensional types
MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.
