Revenue maximization in the dynamic knapsack problem

DOI10.3982/TE700MaRDI QIDQ3006635zbMATH OpenOpenAlexFDO

Authors Deniz Dizdar, Alex Gershkov, Benny Moldovanu

Publication date 20 June 2011

Published in Theoretical Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3982/te700

zbMATH Keywords

knapsack problemmechanism designrevenue maximization

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• The Dynamic and Stochastic Knapsack Problem with Deadlines
• The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
• Heuristic policies for stochastic knapsack problem with time-varying random demand
• The dynamic and stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items

Cited in

(10)

• Ex-post optimal knapsack procurement
• Bayesian optimal knapsack procurement
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
• The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
• On multi-demand knapsack pricing
• A stochastic knapsack game: revenue management in competitions
• Technical note: Optimizing foreclosed housing acquisitions in societal response to foreclosures
• Pricing of multidimensional resources in revenue management (multidimensional dynamic stochastic knapsack problem)
• Optimal dynamic mechanism design with deadlines
• Dynamic revenue maximization: a continuous time approach

This page was built for publication: Revenue maximization in the dynamic knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006635)