Maximizing expected utility over a knapsack constraint

4 years 9 months ago
Maximizing expected utility over a knapsack constraint
The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the items picked while satisfying a constraint on the total weight of items picked. We consider the following solution approach for this problem: (i) use the sample average approximation framework to approximate the stochastic problem as a deterministic knapsack-constrained submodular maximization problem, and then (ii) use an approximation algorithm on the deterministic counterpart. We show that a polynomial number of samples is enough for a deterministic approximation that is close in relative error. Then, exploiting the strict monotonicity of typical utility functions, we present an algorithm that maximizes an increasing submodular function over a knapsack constraint with approximation ratio better than 1 − 1/e. For power utility functions we provide explicit approximation ratios leading to a polynomial time ap...
Jiajin Yu, Shabbir Ahmed
Added 08 Apr 2016
Updated 08 Apr 2016
Type Journal
Year 2016
Where ORL
Authors Jiajin Yu, Shabbir Ahmed
Comments (0)