k-Servers with a Smile: Online Algorithms via Projections

We consider the $k$-server problem on trees and HSTs. We give an algorithms based on %the convex-programming primitive of Bregman projections. This algorithm has a competitive ratios that match some of the recent results given by Bubeck et al. (STOC 2018), whose algorithm was based on mirror-descent-based continuous dynamics prescribed via a differential inclusion.

[1]  James R. Lee,et al.  k-server via multiscale entropic regularization , 2017, STOC.

[2]  Kirk Pruhs,et al.  Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.

[3]  Nikhil R. Devanur,et al.  Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms , 2014, ACM Trans. Algorithms.

[4]  James R. Lee,et al.  Fusible HSTs and the Randomized k-Server Conjecture , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[5]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[6]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[7]  Joseph Naor,et al.  A Simple Analysis for Randomized Online Weighted Paging , 2010 .

[8]  Neal Young,et al.  The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[9]  Noga Alon,et al.  The online set cover problem , 2003, STOC '03.

[10]  Kamesh Munagala,et al.  Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints , 2014, STOC.

[11]  V. Rich.  Personal communication , 1989, Nature.

[12]  Joseph Naor,et al.  Competitive Analysis via Regularization , 2014, SODA.

[13]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[14]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

[15]  BansalNikhil,et al.  A Polylogarithmic-Competitive Algorithm for the k-Server Problem , 2015 .

[16]  Amit Kumar,et al.  Resource augmentation for weighted flow-time explained by dual fitting , 2012, SODA.

[17]  Lukasz Jez,et al.  The (h,k)-Server Problem on Bounded Depth Trees , 2019, ACM Trans. Algorithms.

[18]  Zhiyi Huang,et al.  Welfare maximization with production costs: A primal dual approach , 2019, Games Econ. Behav..