IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v62y2016i8p2374-2391.html
   My bibliography  Save this article

Maximizing Stochastic Monotone Submodular Functions

Author

Listed:
  • Arash Asadpour

    (Stern School of Business, New York University, New York, New York 10012)

  • Hamid Nazerzadeh

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

Abstract

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 .

Suggested Citation

  • Arash Asadpour & Hamid Nazerzadeh, 2016. "Maximizing Stochastic Monotone Submodular Functions," Management Science, INFORMS, vol. 62(8), pages 2374-2391, August.
    • Handle: RePEc:inm:ormnsc:v:62:y:2016:i:8:p:2374-2391
    DOI: 10.1287/mnsc.2015.2254
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2015.2254
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2015.2254?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. G. L. Nemhauser & L. A. Wolsey, 1978. "Best Algorithms for Approximating the Maximum of a Submodular Set Function," Mathematics of Operations Research, INFORMS, vol. 3(3), pages 177-188, August.
    2. Shipra Agrawal & Yichuan Ding & Amin Saberi & Yinyu Ye, 2012. "Price of Correlations in Stochastic Optimization," Operations Research, INFORMS, vol. 60(1), pages 150-162, February.
    3. Nemhauser, G.L. & Wolsey, L.A., 1978. "Best algorithms for approximating the maximum of a submodular set function," LIDAM Reprints CORE 343, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Carri W. Chan & Vivek F. Farias, 2009. "Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 333-350, May.
    5. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao, 2024. "Maximizing stochastic set function under a matroid constraint from decomposition," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-21, August.
    2. Sekar, Shreyas & Vojnovic, Milan & Yun, Se-Young, 2020. "A test score based approach to stochastic submodular optimization," LSE Research Online Documents on Economics 103176, London School of Economics and Political Science, LSE Library.
    3. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    4. Shreyas Sekar & Milan Vojnovic & Se-Young Yun, 2021. "A Test Score-Based Approach to Stochastic Submodular Optimization," Management Science, INFORMS, vol. 67(2), pages 1075-1092, February.
    5. Shaojie Tang, 2022. "Robust Adaptive Submodular Maximization," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3277-3291, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Marek Adamczyk & Maxim Sviridenko & Justin Ward, 2016. "Submodular Stochastic Probing on Matroids," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1022-1038, August.
    2. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    3. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    4. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
    5. Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
    6. Jon Lee & Maxim Sviridenko & Jan Vondrák, 2010. "Submodular Maximization over Multiple Matroids via Generalized Exchange Properties," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 795-806, November.
    7. Cheng Lu & Wenguo Yang & Ruiqi Yang & Suixiang Gao, 2022. "Maximizing a non-decreasing non-submodular function subject to various types of constraints," Journal of Global Optimization, Springer, vol. 83(4), pages 727-751, August.
    8. Maxim Sviridenko & Jan Vondrák & Justin Ward, 2017. "Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1197-1218, November.
    9. Niv Buchbinder & Moran Feldman & Roy Schwartz, 2017. "Comparing Apples and Oranges: Query Trade-off in Submodular Maximization," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 308-329, May.
    10. Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du, 2023. "A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice," Journal of Global Optimization, Springer, vol. 85(1), pages 15-38, January.
    11. Xin Sun & Gaidi Li & Yapu Zhang & Zhenning Zhang, 2022. "Private non-monotone submodular maximization," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3212-3232, December.
    12. Kung, Ling-Chieh & Liao, Wei-Hung, 2018. "An approximation algorithm for a competitive facility location problem with network effects," European Journal of Operational Research, Elsevier, vol. 267(1), pages 176-186.
    13. Niv Buchbinder & Moran Feldman, 2019. "Constrained Submodular Maximization via a Nonsymmetric Technique," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 988-1005, August.
    14. Min Cui & Dachuan Xu & Longkun Guo & Dan Wu, 2022. "Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1671-1690, July.
    15. Manuel A. Nunez & Robert S. Garfinkel & Ram D. Gopal, 2007. "Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction," Operations Research, INFORMS, vol. 55(5), pages 890-908, October.
    16. Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan, 2015. "An accelerated continuous greedy algorithm for maximizing strong submodular functions," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1107-1124, November.
    17. Bin Liu & Zihan Chen & Huijuan Wang & Weili Wu, 2023. "An optimal streaming algorithm for non-submodular functions maximization on the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-17, January.
    18. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2021. "Maximizing Sequence-Submodular Functions and Its Application to Online Advertising," Management Science, INFORMS, vol. 67(10), pages 6030-6054, October.
    19. Zengfu Wang & Bill Moran & Xuezhi Wang & Quan Pan, 2016. "Approximation for maximizing monotone non-decreasing set functions with a greedy method," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 29-43, January.
    20. Shaojie Tang & Jing Yuan, 2021. "Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2143-2161, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:62:y:2016:i:8:p:2374-2391. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.