[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Online submodular maximization: beating 1/2 made simple

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

The Submodular Welfare Maximization problem (SWM) captures an important subclass of combinatorial auctions and has been studied extensively. In particular, it has been studied in a natural online setting in which items arrive one-by-one and should be allocated irrevocably upon arrival. For this setting, Korula et al. (SIAM J Comput 47(3):1056–1086, 2018) were able to show that the greedy algorithm is 0.5052-competitive when the items arrive in a uniformly random order. Unfortunately, however, their proof is very long and involved. In this work, we present an (arguably) much simpler analysis of the same algorithm that provides a slightly better guarantee of 0.5096-competitiveness. Moreover, this analysis applies also to a generalization of online SWM in which the sets defining a (simple) partition matroid arrive online in a uniformly random order, and we would like to maximize a monotone submodular function subject to this matroid. Furthermore, for this more general problem, we prove an upper bound of 0.574 on the competitive ratio of the greedy algorithm, ruling out the possibility that the competitiveness of this natural algorithm matches the optimal offline approximation ratio of \(1-1/e\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Notes

  1. A set function \(f:2^\mathscr {N}\rightarrow \mathbb {R}\) is monotone if \(f(S) \le f(T)\) for every two sets \(S \subseteq T \subseteq \mathscr {N}\) and submodular if \(f(S \cup \{u\}) - f(S) \ge f(T \cup \{u\}) - f(T)\) for every two such sets and an element \(u \in \mathscr {N}{\setminus } T\).

  2. This constraint on the set of items that can be selected is equivalent to selecting an independent set of the partition matroid \(\mathscr {M}\) defined by the partition \(\{P_1, P_2, \ldots , P_m\}\).

  3. A slightly weaker bound of 19 / 33, with a simpler proof, appeared in the conference version of this paper [4].

  4. A weighted coverage function f is defined as \(f(S) = \sum _{e \in \left( \bigcup _{A \in S} A\right) } w(e)\) for every \(S \subseteq \mathscr {N}\). We remark that such functions are well-known to be monotone and submodular.

References

  1. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA, pp. 1253–1264 (2011)

  2. Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: EC, pp. 18–35 (2012)

  3. Badanidiyuru, A., Vondrák, J.: Fast algorithms for maximizing submodular functions. In: SODA, pp. 1497–1514 (2014)

  4. Buchbinder, N., Feldman, M., Filmus, Y., Garg, M.: Online submodular maximization: beating 1/2 made simple. In: IPCO, pp. 101–114 (2019)

  5. Buchbinder, N., Feldman, M., Garg, M.: Deterministic \(({1}/{2}+\varepsilon )\)-approximation for submodular maximization over a matroid. In: SODA, pp. 241–254 (2019)

  6. Buchbinder, N., Feldman, M., Schwartz, R.: Comparing apples and oranges: query trade-off in submodular maximization. Math. Oper. Res. 42(2), 308–329 (2017)

    Article  MathSciNet  Google Scholar 

  7. Buchbinder, N., Jain, K., Naor, J.: Online primal–dual algorithms for maximizing ad-auctions revenue. In: ESA, pp. 253–264 (2007)

  8. Călinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740–1766 (2011)

    Article  MathSciNet  Google Scholar 

  9. Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC, pp. 71–78 (2009)

  10. Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: EC, pp. 29–38 (2011)

  11. Devanur, N.R., Sivan, B., Azar, Y.: Asymptotically optimal algorithm for stochastic adwords. In: EC, pp. 388–404 (2012)

  12. Feige, U., Mirrokni, V.S., Vondrák, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133–1153 (2011)

    Article  MathSciNet  Google Scholar 

  13. Feige, U., Vondrák, J.: The submodular welfare problem with demand queries. Theory Comput. 6(1), 247–290 (2010)

    Article  MathSciNet  Google Scholar 

  14. Feldman, J., Korula, N., Mirrokni, V.S., Muthukrishnan, S., Pál, M.: Online ad assignment with free disposal. In: WINE, pp. 374–385 (2009)

  15. Feldman, J., Mehta, A., Mirrokni, V.S., Muthukrishnan, S.: Online stochastic matching: beating 1-1/e. In: FOCS, pp. 117–126 (2009)

  16. Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: FOCS, pp. 570–579 (2011)

  17. Filmus, Y., Ward, J.: Monotone submodular maximization over a matroid via non-oblivious local search. SIAM J. Comput. 43(2), 514–542 (2014)

    Article  MathSciNet  Google Scholar 

  18. Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions—II. Math. Program. Study 8, 73–87 (1978)

    Article  MathSciNet  Google Scholar 

  19. Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA, pp. 982–991 (2008)

  20. Guruganesh, G.P., Singla, S.: Online matroid intersection: beating half for random arrival. In: IPCO, pp. 241–253 (2017)

  21. Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: improved approximation algorithms. In: WINE, pp. 170–181 (2011)

  22. Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1–2), 319–325 (2000)

    Article  MathSciNet  Google Scholar 

  23. Kapralov, M., Post, I., Vondrák, J.: Online submodular welfare maximization: greedy is optimal. In: SODA, pp. 1216–1225 (2013)

  24. Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC, pp. 587–596 (2011)

  25. Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352–358 (1990)

  26. Konrad, C., Magniez, F., Mathieu, C.: Maximum matching in semi-streaming with few passes. In: APPROX, pp. 231–242 (2012)

  27. Korula, N., Mirrokni, V.S., Zadimoghaddam, M.: Online submodular welfare maximization: greedy beats 1/2 in random order. SIAM J. Comput. 47(3), 1056–1086 (2018)

    Article  MathSciNet  Google Scholar 

  28. Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: STOC, pp. 597–606 (2011)

  29. Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37(4), 559–573 (2012)

    Article  MathSciNet  Google Scholar 

  30. Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265–368 (2013)

    Article  MathSciNet  Google Scholar 

  31. Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized online matching. J. ACM 54(5), 22 (2007)

    Article  MathSciNet  Google Scholar 

  32. Mirrokni, V.S., Schapira, M., Vondrák, J.: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In: EC, pp. 70–77 (2008)

  33. Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A., Vondrák, J., Krause, A.: Lazier than lazy greedy. In: AAAI, pp. 1812–1818 (2015)

  34. Norouzi-Fard, A., Tarnawski, J., Mitrovic, S., Zandieh, A., Mousavifar, A., Svensson, O.: Beyond 1/2-approximation for submodular maximization on massive data streams. In: ICML, pp. 3826–3835 (2018)

  35. Zadimoghaddam, M.: Online weighted matching: beating the 1/2 barrier. CoRR (2017). arXiv:1704.05384

Download references

Author information

Author notes

  1. Moran Feldman

    Present address: Department of Computer Science, University of Haifa, 199 Aba Khoushy Ave., Haifa, 3498838, Israel

  2. Mohit Garg

    Present address: IDSIA, USI-SUPSI, Lugano, Switzerland

Authors and Affiliations

  1. Department of Statistics and Operations Research, Tel Aviv University, P.O. Box 39040, 6997801, Tel Aviv, Israel

    Niv Buchbinder

  2. Department of Mathematics and Computer Science, The Open University of Israel, 1 University Road, P.O. Box 808, 4353701, Raanana, Israel

    Moran Feldman & Mohit Garg

  3. Department of Computer Science, Technion — Israel Institute of Technology, Technion City, 3200003, Haifa, Israel

    Yuval Filmus

Authors
  1. Niv Buchbinder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moran Feldman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuval Filmus
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohit Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moran Feldman.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

An earlier version of this work appeared in IPCO 2019 [4].

We thank Nitish Korula, Vahab S. Mirrokni and Morteza Zadimoghaddam for sharing with us the full version of their paper [27] before it was officially published. The research of Niv Buchbinder was supported by Israel Science Foundation Grant 2233/19 and United States - Israel Binational Science Foundation Grant 2018352. The research of Moran Feldman and Mohit Garg was supported in part by Israel Science Foundation Grant 1357/16. Yuval Filmus is a Taub Fellow—supported by the Taub Foundations. His research was funded by Israel Science Foundation Grant 1337/16.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Buchbinder, N., Feldman, M., Filmus, Y. et al. Online submodular maximization: beating 1/2 made simple. Math. Program. 183, 149–169 (2020). https://doi.org/10.1007/s10107-019-01459-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-019-01459-z

Keywords

Mathematics Subject Classification

Search

Navigation