Document Open Access Logo

Chasing Small Sets Optimally Against Adaptive Adversaries

Authors Christian Coester , Alexa Tudose

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2026.67.pdf
  • Filesize: 0.99 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • online algorithms
  • competitive analysis
  • chasing small sets
  • layered graph traversal
  • metrical service systems

Metrics

Abstract

We study deterministic online algorithms for the problem of chasing sets of cardinality at most k in a metric space, also known as metrical service systems and equivalent to width-k layered graph traversal. We resolve the 30-year-old gap of Ω(2^k)∩ O(k2^k) on the competitive ratio of this problem by giving an O(2^k)-competitive deterministic algorithm. This bound is optimal even among randomized algorithms against adaptive adversaries. We also (slightly) improve the deterministic lower bound to D_k, defined recursively by D₁ = 1 and D_{k+1} = 2D_k+√{8+8D_k}+3, which we conjecture to be exactly tight. For k = 3, we provide a matching upper bound of D₃. Our results imply slightly improved upper and lower bounds for distributed asynchronous collective tree exploration and for the k-taxi problem, respectively.
Our algorithm generalizes the classical doubling strategy, previously known to be optimal for k = 2. The previous best bound for general k was achieved by the generalized work function algorithm (WFA), and was known to be tight for WFA. Our improved bound therefore implies that WFA is sub-optimal for chasing small sets.

Cite As Get BibTex

Christian Coester and Alexa Tudose. Chasing Small Sets Optimally Against Adaptive Adversaries. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 67:1-67:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ICALP.2026.67

Author Details

Christian Coester
  • University of Oxford, UK
Alexa Tudose
  • University of Oxford, UK

Funding

  • Coester, Christian: Funded by the European Union (ERC, CCOO, 101165139). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them.

References

  1. Keerti Anand, Rong Ge, Amit Kumar, and Debmalya Panigrahi. A regression approach to learning-augmented online algorithms. In Advances in Neural Information Processing Systems, volume 34, pages 30504-30517, 2021. URL: https://proceedings.neurips.cc/paper_files/paper/2021/file/ffeed84c7cb1ae7bf4ec4bd78275bb98-Paper.pdf.
  2. Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, and Bertrand Simon. Mixing predictions for online metric algorithms. In International Conference on Machine Learning, ICML, volume 202 of Proceedings of Machine Learning Research, pages 969-983, 2023. URL: https://proceedings.mlr.press/v202/antoniadis23b.html.
  3. Antonios Antoniadis, Christian Coester, Marek Eliáš, Adam Polak, and Bertrand Simon. Online metric algorithms with untrusted predictions. ACM Transactions on Algorithms, 19(2):1-34, 2023. URL: https://doi.org/10.1145/3582689.
  4. C. J. Argue, Anupam Gupta, Ziye Tang, and Guru Guruganesh. Chasing convex bodies with linear competitive ratio. J. ACM, 68(5):32:1-32:10, 2021. URL: https://doi.org/10.1145/3450349.
  5. Ricardo A. Baeza-Yates, Joseph C. Culberson, and Gregory J. E. Rawlins. Searching in the plane. Inf. Comput., 106(2):234-252, 1993. URL: https://doi.org/10.1006/INCO.1993.1054.
  6. Xingjian Bai, Christian Coester, and Romain Cosson. Unweighted layered graph traversal: Passing a crown via entropy maximization. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 3884-3900, 2025. URL: https://doi.org/10.1137/1.9781611978322.131.
  7. Anatole Beck and D. J. Newman. Yet more on the linear search problem. Israel Journal of Mathematics, 8(4):419-429, 1970. URL: https://doi.org/10.1007/BF02798690.
  8. Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, and Avi Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2-14, 1994. URL: https://doi.org/10.1007/BF01294260.
  9. Allan Borodin, Nathan Linial, and Michael E. Saks. An optimal on-line algorithm for metrical task system. J. ACM, 39(4):745-763, 1992. URL: https://doi.org/10.1145/146585.146588.
  10. Sébastien Bubeck, Christian Coester, and Yuval Rabani. Shortest paths without a map, but with an entropic regularizer. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 1102-1113, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00036.
  11. Sébastien Bubeck, Christian Coester, and Yuval Rabani. The randomized k-server conjecture is false! In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC, pages 581-594, 2023. URL: https://doi.org/10.1145/3564246.3585132.
  12. Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke. Competitively chasing convex bodies. SIAM J. Comput., 52(2):STOC19-339-STOC19-353, 2023. URL: https://doi.org/10.1137/20M1312332.
  13. William R. Burley. Traversing layered graphs using the work function algorithm. J. Algorithms, 20(3):479-511, 1996. URL: https://doi.org/10.1006/JAGM.1996.0024.
  14. Marek Chrobak and Lawrence L. Larmore. The server problem and on-line games. In On-Line Algorithms, Proceedings of a DIMACS Workshop, volume 7 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 11-64, 1991. URL: https://doi.org/10.1090/DIMACS/007/02.
  15. Christian Coester and Elias Koutsoupias. The online k-taxi problem. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 1136-1147, 2019. URL: https://doi.org/10.1145/3313276.3316370.
  16. Christian Coester and Tze-Yang Poon. Online 3-taxi on general metrics. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 6659-6673, 2026. URL: https://doi.org/10.1137/1.9781611978971.238.
  17. Christian Coester and Alexa Tudose. Chasing small sets optimally against adaptive adversaries. arXiv preprint, 2026. URL: https://arxiv.org/abs/2605.10927.
  18. Romain Cosson and Laurent Massoulié. Asynchronous collective tree exploration: a distributed algorithm, and a new lower bound. arXiv preprint arXiv:2507.15658, 2025. URL: https://doi.org/10.48550/arXiv.2507.15658.
  19. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, and Sundar Vishwanathan. Competitive algorithms for layered graph traversal. SIAM J. Comput., 28(2):447-462, 1998. URL: https://doi.org/10.1137/S0097539795279943.
  20. J. Friedman and N. Linial. On convex body chasing. Discrete and computational geometry, 9(3):293-322, 1993. URL: https://doi.org/10.1007/BF02189324.
  21. Elias Koutsoupias and Christos H. Papadimitriou. On the k-server conjecture. J. ACM, 42(5):971-983, 1995. URL: https://doi.org/10.1145/210118.210128.
  22. Christos H. Papadimitriou and Mihalis Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84(1):127-150, 1991. URL: https://doi.org/10.1016/0304-3975(91)90263-2.
  23. H. Ramesh. On traversing layered graphs on-line. J. Algorithms, 18(3):480-512, 1995. URL: https://doi.org/10.1006/JAGM.1995.1019.
  24. Mark Sellke. Chasing convex bodies optimally. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1509-1518, 2020. URL: https://doi.org/10.1137/1.9781611975994.92.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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