Competitively chasing convex bodies
From MaRDI portal
Publication:5212826
DOI10.1145/3313276.3316314zbMath1434.68688arXiv1811.00887OpenAlexW2964057371MaRDI QIDQ5212826
Mark Sellke, Sébastien Bubeck, Yuanzhi Li, Yin Tat Lee
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.00887
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)
Related Items
Lipschitz selectors may not yield competitive algorithms for convex body chasing, Nested convex bodies are chaseable, Better Bounds for Online Line Chasing
