261 citations · 1.4k across the 45 of their papers we have counts for
10 papers · 1 filter
The Randomized -Server Conjecture is False!
Sébastien Bubeck, Christian Coester, Yuval Rabani
We prove a few new lower bounds on the randomized competitive ratio for the -server problem and other related problems, resolving some long-standing conjectures. In particular,…
Shortest Paths without a Map, but with an Entropic Regularizer
Sébastien Bubeck, Christian Coester, Yuval Rabani
In a 1989 paper titled "shortest paths without a map", Papadimitriou and Yannakakis introduced an online model of searching in a weighted layered graph for a target node, while att…
Online Multiserver Convex Chasing and Optimization
Sébastien Bubeck, Yuval Rabani, Mark Sellke
We introduce the problem of -chasing of convex functions, a simultaneous generalization of both the famous k-server problem in , and of the problem of chasing convex bodies…
Parametrized Metrical Task Systems
Sébastien Bubeck, Yuval Rabani
We consider parametrized versions of metrical task systems and metrical service systems, two fundamental models of online computing, where the constrained parameter is the number o…
Competitively Chasing Convex Bodies
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li +1
Let be a family of sets in some metric space. In the -chasing problem, an online algorithm observes a request sequence of sets in and respo…
Chasing Nested Convex Bodies Nearly Optimally
Sébastien Bubeck, Bo'az Klartag, Yin Tat Lee +2
The convex body chasing problem, introduced by Friedman and Linial, is a competitive analysis problem on any normed vector space. In convex body chasing, for each timestep $t\in\ma…