Talks
Fall 2016
Mirror Descent Perspective on the K-server Problem
Monday, December 4th, 2017, 9:30 am–10:00 am
Speaker:
We will sketch a recent result that provides an O(log^2(k)*log(n)) competitive algorithm for the k-server problem.
Joint work with Sebastien Bubeck, Michael B. Cohen, James Lee, and Yin-Tat Lee.
