Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
104 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
40 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Online Submodular Assignment Problem (2401.06981v2)

Published 13 Jan 2024 in cs.DS

Abstract: Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazirani [KVV90]. Since then, many variants have been studied, including AdWords, the generalized assignment problem (GAP), and online submodular welfare maximization. In this paper, we introduce a generalization of GAP which we call the submodular assignment problem (SAP). This generalization captures many online assignment problems, including all classical online bipartite matching problems as well as broader online combinatorial optimization problems such as online arboricity, flow scheduling, and laminar restricted allocations. We present a fractional algorithm for online SAP that is $(1-\frac{1}{e})$-competitive. Additionally, we study several integral special cases of the problem. In particular, we provide a $(1-\frac{1}{e}-\epsilon)$-competitive integral algorithm under a small-bids assumption, and a $(1-\frac{1}{e})$-competitive integral algorithm for online submodular welfare maximization where the utility functions are given by rank functions of matroids. The key new ingredient for our results is the construction and structural analysis of a "water level" vector for polymatroids, which allows us to generalize the classic water-filling paradigm used in online matching problems. This construction reveals connections to submodular utility allocation markets and principal partition sequences of matroids.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Online vertex-weighted bipartite matching and single-bid budgeted allocations. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pages 1253–1264. SIAM, 2011.
  2. Optimal algorithms for online b-matching with variable vertex capacities. In Mary Wootters and Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference), volume 207 of LIPIcs, pages 2:1–2:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  3. Multiway online correlated selection. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 1277–1284. IEEE, 2021.
  4. Finding fair and efficient allocations for matroid rank valuations. ACM Transactions on Economics and Computation, 9(4):1–41, 2021.
  5. Fair and truthful mechanisms for dichotomous valuations. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, pages 5119–5126. AAAI Press, 2021.
  6. Maintaining matroid intersections online. CoRR, abs/2309.10214, 2023.
  7. Lossless online rounding for online bipartite matching (despite its impossibility). In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 2030–2068. SIAM, 2023.
  8. Truthful and fair mechanisms for matroid-rank valuations. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 4801–4808. AAAI Press, 2022.
  9. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6):1740–1766, 2011.
  10. Coflow: a networking abstraction for cluster applications. In Srikanth Kandula, Jitendra Padhye, Emin Gün Sirer, and Ramesh Govindan, editors, 11th ACM Workshop on Hot Topics in Networks, HotNets-XI, Redmond, WA, USA - October 29 - 30, 2012, pages 31–36. ACM, 2012.
  11. Approximating submodular k-partition via principal partition sequence. In Nicole Megow and Adam D. Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA, volume 275 of LIPIcs, pages 3:1–3:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  12. Are gross substitutes a substitute for submodular valuations? In Péter Biró, Shuchi Chawla, and Federico Echenique, editors, EC ’21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021, pages 390–408. ACM, 2021.
  13. On fair division under heterogeneous matroid constraints. Journal of Artificial Intelligence Research, 76:567–611, 2023.
  14. Online matching with concave returns. In Howard J. Karloff and Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, pages 137–144. ACM, 2012.
  15. Randomized primal-dual analysis of ranking for online bipartite matching. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’13, page 101–107, USA, 2013. Society for Industrial and Applied Mathematics.
  16. Jack Edmonds. Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B, 69B:67–72, 1965.
  17. Uriel Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634–652, 1998.
  18. Uriel Feige. Tighter Bounds for Online Bipartite Matching, pages 235–255. Springer Berlin Heidelberg, Berlin, Heidelberg, 2019.
  19. Edge-weighted online bipartite matching. In Sandy Irani, editor, 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 412–423. IEEE, 2020.
  20. Satoru Fujishige. Theory of principal partitions revisited. In William J. Cook, László Lovász, and Jens Vygen, editors, Research Trends in Combinatorial Optimization, Bonn Workshop on Combinatorial Optimization, November 3-7, 2008, Bonn, Germany, pages 127–162. Springer, 2008.
  21. Improved online correlated selection. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 1265–1276. IEEE, 2021.
  22. Online matroid intersection: Beating half for random arrival. In Friedrich Eisenbrand and Jochen Koenemann, editors, Integer Programming and Combinatorial Optimization, pages 241–253, Cham, 2017. Springer International Publishing.
  23. Robust sparsification for matroid intersection with applications. CoRR, abs/2310.16827, 2023.
  24. Matroid coflow scheduling. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece, volume 132 of LIPIcs, pages 145:1–145:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
  25. Asymptotically optimal approximation algorithms for coflow scheduling. In Christian Scheideler and Mohammad Taghi Hajiaghayi, editors, Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, pages 45–54. ACM, 2017.
  26. Eisenberg-gale markets: Algorithms and game-theoretic properties. Games Econ. Behav., 70(1):84–106, 2010.
  27. Donald E. Knuth. Matroid partitioning. Technical report, Stanford University, Stanford, CA, USA, 1973.
  28. Online submodular welfare maximization: Greedy is optimal. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 1216–1225. SIAM, 2013.
  29. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pages 352–358. ACM, 1990.
  30. H. Narayanan. The principal lattice of partitions of a submodular function. Linear Algebra and its Applications, 144:179–216, 1991.
  31. Algorithmic Game Theory. Cambridge University Press, 2007.
  32. Online stochastic max-weight bipartite matching: Beyond prophet inequalities. In Péter Biró, Shuchi Chawla, and Federico Echenique, editors, EC ’21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18-23, 2021, pages 763–764. ACM, 2021.
  33. Making three out of two: Three-way online correlated selection. In Hee-Kap Ahn and Kunihiko Sadakane, editors, 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan, volume 212 of LIPIcs, pages 49:1–49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  34. Alexander Schrijver. Combinatorial optimization. Polyhedra and efficiency. Vol. B, volume 24 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003. Matroids, trees, stable sets, Chapters 39–69.
  35. José A. Soto. Matroid secretary problem in the random-assignment model. SIAM J. Comput., 42(1):178–211, 2013.
  36. A general framework for fair allocation under matroid rank valuations. In Kevin Leyton-Brown, Jason D. Hartline, and Larry Samuelson, editors, Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, London, United Kingdom, July 9-12, 2023, pages 1129–1152. ACM, 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now