License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2021.9
URN: urn:nbn:de:0030-drops-145904
Go to the corresponding LIPIcs Volume Portal

Ayyadevara, Nikhil ; Chiplunkar, Ashish

The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential

LIPIcs-ESA-2021-9.pdf (0.6 MB)


The weighted k-server problem is a natural generalization of the k-server problem in which the cost incurred in moving a server is the distance traveled times the weight of the server. Even after almost three decades since the seminal work of Fiat and Ricklin (1994), the competitive ratio of this problem remains poorly understood even on the simplest class of metric spaces - the uniform metric spaces. In particular, in the case of randomized algorithms against the oblivious adversary, neither a better upper bound that the doubly exponential deterministic upper bound, nor a better lower bound than the logarithmic lower bound of unweighted k-server, is known. In this paper, we make significant progress towards understanding the randomized competitive ratio of weighted k-server on uniform metrics. We cut down the triply exponential gap between the upper and lower bound to a singly exponential gap by proving that the competitive ratio is at least exponential in k, substantially improving on the previously known lower bound of about ln k.

BibTeX - Entry

  author =	{Ayyadevara, Nikhil and Chiplunkar, Ashish},
  title =	{{The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential}},
  booktitle =	{29th Annual European Symposium on Algorithms (ESA 2021)},
  pages =	{9:1--9:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-204-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{204},
  editor =	{Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-145904},
  doi =		{10.4230/LIPIcs.ESA.2021.9},
  annote =	{Keywords: weighted k-server, competitive analysis}

Keywords: weighted k-server, competitive analysis
Collection: 29th Annual European Symposium on Algorithms (ESA 2021)
Issue Date: 2021
Date of publication: 31.08.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI