Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
- 95 Downloads
We consider stochastic variants of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary distributions. Items are placed in the knapsack sequentially, and the act of placing an item in the knapsack instantiates its size. The goal is to compute a policy for insertion of the items, that maximizes the expected value of the set of items placed in the knapsack. These variants that we study differ only in the formula for computing the value of the final solution obtained by the policy. We consider both nonadaptive policies (that designate a priori a fixed subset or permutation of items to insert) and adaptive policies (that can make dynamic decisions based on the instantiated sizes of the items placed in the knapsack thus far). Our work characterizes the benefit of adaptivity. For this purpose we use a measure called the adaptivity gap: the supremum over instances of the ratio between the expected value obtained by an optimal adaptive policy and the expected value obtained by an optimal non-adaptive policy. We show that while for the variants considered in the literature this quantity is bounded by a constant there are other variants where it is unbounded.
KeywordsKnapsack Benefit of adaptivity Stochastic combinatorial optimization
The authors thank Shmuel Onn for suggesting the study of the WT as an interesting variant of SKP.
- Asadpour A, Nazerzadeh H, Saberi A (2008) Stochastic submodular maximization. In: Proceedings of the 4th international workshop on internet and network economics (WINE 2008), pp 477–489Google Scholar
- Bhalgat A (2011) A \((2 + \varepsilon )\)-approximation algorithm for the stochastic knapsack problem. Unpublished manuscript. https://pdfs.semanticscholar.org/9ecc/0df2be775950828941c46019534272321918.pdf
- Bhalgat A, Goel A, Khanna S (2011) Improved Approximation results for stochastic knapsack problems. In: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms (SODA 2011), pp 1647–1665Google Scholar
- Dean BC (2005) Approximation algorithms for stochastic scheduling problems. Ph.D. dissertation, MITGoogle Scholar
- Dean BC, Goemans MX, Vondrák J (2005) Adaptivity and approximation for stochastic packing problems. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA’2005), pp 395–404Google Scholar
- Goemans MX, Vondrák J (2006) Stochastic covering and adaptivity. In: Proceedings of the 7th Latin American symposium on theoretical informatics (LATIN’2006), pp 532–543Google Scholar
- Guha S, Munagala K (2007) Model-driven optimization using adaptive probes. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA’2007), pp 308–317Google Scholar
- Gupta A, Krishnaswamy R, Molinaro M, Ravi R (2011) Approximation algorithms for correlated knapsacks and non-martingale bandits. In: Proceedings of the 52nd symposium on foundations of computer science (FOCS’2011), pp 827–836Google Scholar
- Li J, Yuan W (2013) Stochastic combinatorial optimization via poisson approximation. In: Proceedings of the 45th annual ACM symposium on theory of computing (STOC 2013), pp 971–980Google Scholar
- Ma W (2014) Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms (SODA 2014), pp 1154–1163Google Scholar