Maximizing Stochastic Monotone Submodular Functions

We study the problem of maximizing a stochastic monotone submodular function with respect to a matroid constraint. Because of the presence of diminishing marginal values in real-world problems, our model can capture the effect of stochasticity in a wide range of applications. We show that the adaptivity gap—the ratio between the values of optimal adaptive and optimal nonadaptive policies—is bounded and is equal to e/(e − 1). We propose a polynomial-time nonadaptive policy that achieves this bound. We also present an adaptive myopic policy that obtains at least half of the optimal value. Furthermore, when the matroid is uniform, the myopic policy achieves the optimal approximation ratio of 1 − 1/e. This paper was accepted by Dimitris Bertsimas and Yinyu Ye, optimization.

• 저널Management Science · 62(8) · 2374–2391
• 토픽Complexity and Algorithms in Graphs · Computational Theory and Mathematics
• DOI10.1287/mnsc.2015.2254
• 저자Arash Asadpour, Hamid Nazerzadeh