k-server via multiscale entropic regularization

DOI10.1145/3188745.3188798zbMath1427.68372arXiv1711.01085OpenAlexW2963331653MaRDI QIDQ5230272

Sébastien Bubeck, Yin Tat Lee, James R. Lee, Aleksander Mądry, Michael B. Cohen

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01085

zbMATH Keywords

\(k\)-server algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (10)

An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals ⋮ Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ Unnamed Item ⋮ Dynamic pricing of servers on trees ⋮ On the Facility Location Problem in Online and Dynamic Models. ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Managing multiple mobile resources ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing ⋮ Memoryless algorithms for the generalized k-server problem on uniform metrics

This page was built for publication: k-server via multiscale entropic regularization