Document Open Access Logo

Online Matching with Delays and Size-Based Costs

Authors Yasushi Kawase , Tomohiro Nakayoshi

PDF
Thumbnail PDF

File

LIPIcs.STACS.2025.59.pdf
  • Filesize: 0.86 MB
  • 18 pages

Document Identifiers

Author Details

Yasushi Kawase
  • The University of Tokyo, Japan
Tomohiro Nakayoshi
  • The University of Tokyo, Japan

Funding

  • Kawase, Yasushi: JST ERATO Grant Number JPMJER2301, JST PRESTO Grant Number JPMJPR2122, JSPS KAKENHI Grant Number JP20K19739, and Value Exchange Engineering, a joint research project between Mercari, Inc. and the RIISE.

Acknowledgements

The authors thank anonymous reviewers for useful comments.

Cite As Get BibTex

Yasushi Kawase and Tomohiro Nakayoshi. Online Matching with Delays and Size-Based Costs. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 59:1-59:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.59

Abstract

In this paper, we introduce the problem of Online Matching with Delays and Size-based Costs (OMDSC). The OMDSC problem involves m requests arriving online. At any time, a group can be formed by matching any number of requests that have been received but remain unmatched. The cost associated with each group is determined by the waiting time for each request within the group and size-dependent cost. The size-dependent cost is specified by a penalty function. Our goal is to partition all the incoming requests into multiple groups while minimizing the total associated cost. This problem is an extension of the TCP acknowledgment problem proposed by Dooly et al. (J. ACM, 2001). It generalizes the cost model for sending acknowledgments. This study reveals the competitive ratios for a fundamental case, in which the penalty function takes only values of either 0 or 1. We classify such penalty functions into three distinct cases: (i) a fixed penalty of 1 regardless of the group size, (ii) a penalty of 0 if and only if the group size is a multiple of a specific integer k, and (iii) other situations. The problem in case (i) is equivalent to the TCP acknowledgment problem, for which Dooly et al. proposed a 2-competitive algorithm. For case (ii), we first show that natural algorithms that match all remaining requests are Ω(√k)-competitive. We then propose an O(log k / log log k)-competitive deterministic algorithm by carefully managing the match size and timing, and prove its optimality. For any penalty function in case (iii), we demonstrate the non-existence of a competitive online algorithm. Additionally, we discuss competitive ratios for other typical penalty functions that are not restricted to take values of 0 or 1.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • Online matching
  • competitive analysis
  • delayed service

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Yossi Azar, Ashish Chiplunkar, and Haim Kaplan. Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pages 1051-1061, 2017. URL: https://doi.org/10.1137/1.9781611974782.67.
  2. Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou. Set cover with delay - Clairvoyance is not required. In Proceedings of the 28th Annual European Symposium on Algorithms (ESA 2020), pages 8:1-8:21, 2020. URL: https://doi.org/10.4230/LIPIcs.ESA.2020.8.
  3. Yossi Azar and Amit Jacob Fanani. Deterministic min-cost matching with delays. Theory Comput. Syst., 64(4):572-592, 2020. URL: https://doi.org/10.1007/s00224-019-09963-7.
  4. Yossi Azar, Runtian Ren, and Danny Vainstein. The min-cost matching with concave delays problem. In Proceedings of the 2021 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), pages 301-320, 2021. URL: https://doi.org/10.1137/1.9781611976465.20.
  5. Yossi Azar and Noam Touitou. General framework for metric optimization problems with delay or with deadlines. In Proceedings of the 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019), pages 60-71, 2019. URL: https://doi.org/10.1109/FOCS.2019.00013.
  6. Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Luk'avs Folwarczn'y, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, and Pavel Veselý. Online algorithms for multi-level aggregation. In Proceedings of the 24th Annual European Symposium on Algorithms (ESA 2016), pages 12:1-12:17, 2016. URL: https://doi.org/10.4230/LIPIcs.ESA.2016.12.
  7. Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, and Jirí Sgall. Better approximation bounds for the joint replenishment problem. In Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pages 42-54, 2014. URL: https://doi.org/10.1137/1.9781611973402.4.
  8. Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, and Pawel Schmidt. A primal-dual online deterministic algorithm for matching with delays. In Proceedings of the 16th Workshop on Approximation and Online Algorithms (WAOA 2018), pages 51-68, 2018. URL: https://doi.org/10.1007/978-3-030-04693-4_4.
  9. Niv Buchbinder, Moran Feldman, Joseph S. Naor, and Ohad Talmon. O(depth)-competitive algorithm for online multi-level aggregation. In Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pages 1235-1244, 2017. URL: https://doi.org/10.1137/1.9781611974782.80.
  10. Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, and Maxim Sviridenko. Online make-to-order joint replenishment model: Primal-dual competitive algorithms. Oper. Res., 61(4):1014-1029, 2013. URL: https://doi.org/10.1287/opre.2013.1188.
  11. Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, and José Verschae. The online set aggregation problem. In Proceedings of the 13th Latin American Symposium on Theoretical Informatics (LATIN 2018), pages 245-259, 2018. URL: https://doi.org/10.1007/978-3-319-77404-6_19.
  12. Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh. Online weighted cardinality joint replenishment problem with delay. In Proceedings of the 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), pages 40:1-40:18, 2022. URL: https://doi.org/10.4230/LIPIcs.ICALP.2022.40.
  13. Lindsey Deryckere and Seeun William Umboh. Online matching with set and concave delays. In Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), pages 17:1-17:17, 2023. URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.17.
  14. Daniel R. Dooly, Sally A. Goldman, and Stephen D. Scott. On-line analysis of the TCP acknowledgment delay problem. J. ACM, 48(2):243-273, 2001. URL: https://doi.org/10.1145/375827.375843.
  15. Federico Echenique, Nicole Immorlica, and Vijay V. Vazirani. Online and Matching-Based Market Design. Cambridge University Press, 2023. URL: https://doi.org/10.1017/9781108937535.
  16. Yuval Emek, Shay Kutten, and Roger Wattenhofer. Online matching: Haste makes waste! In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2016), pages 333-344, 2016. URL: https://doi.org/10.1145/2897518.2897557.
  17. Yuval Emek, Yaacov Shapiro, and Yuyi Wang. Minimum cost perfect matching with delays for two sources. Theor. Comput. Sci., 754:122-129, 2019. URL: https://doi.org/10.1016/j.tcs.2018.07.004.
  18. Kun He, Sizhe Li, Enze Sun, Yuyi Wang, Roger Wattenhofer, and Weihao Zhu. Randomized algorithm for MPMD on two sources. In Proceedings of the 19th Conference On Web And InterNet Economics (WINE 2023), pages 348-365, 2023. URL: https://doi.org/10.1007/978-3-031-48974-7_20.
  19. Naonori Kakimura and Tomohiro Nakayoshi. Deterministic primal-dual algorithms for online k-way matching with delays. In Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023), pages 238-249, 2023. URL: https://doi.org/10.1007/978-3-031-49193-1_18.
  20. Anna R. Karlin, Claire Kenyon, and Dana Randall. Dynamic TCP acknowledgement and other stories about e/(e-1). In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pages 502-509, 2001. URL: https://doi.org/10.1145/380752.380845.
  21. Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1990), pages 352-358, 1990. URL: https://doi.org/10.1145/100216.100262.
  22. Yasushi Kawase and Tomohiro Nakayoshi. Online matching with delays and size-based costs. arXiv:2408.08658, 2024. URL: https://doi.org/10.48550/arXiv.2408.08658.
  23. Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer. Impatient online matching. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018), pages 62:1-62:12, 2018. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.62.
  24. Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer. Online matching with convex delay costs. arXiv:2203.03335, 2022. URL: https://doi.org/10.48550/arXiv.2203.03335.
  25. Aranyak Mehta. Online matching and ad allocation. Found. Trends Theor. Comput. Sci., 8(4):265-368, 2013. URL: https://doi.org/10.1561/0400000057.
  26. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, and Vijay V. Vazirani. AdWords and generalized online matching. J. ACM, 54(5):22:1-22:19, 2007. URL: https://doi.org/10.1145/1284320.1284321.
  27. Darya Melnyk, Yuyi Wang, and Roger Wattenhofer. Online k-way matching with delays and the H-metric. arXiv:2109.06640, 2021. URL: https://doi.org/10.48550/arXiv.2109.06640.
  28. Marco Pavone, Amin Saberi, Maximilian Schiffer, and Matthew W. Tsao. Technical note - online hypergraph matching with delays. Oper. Res., 70(4):2194-2212, 2022. URL: https://doi.org/10.1287/opre.2022.2277.
  29. Noam Touitou. Nearly-tight lower bounds for set cover and network design with deadlines/delay. In Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pages 53:1-53:16, 2021. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2021.53.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact