The Randomized Competitive Ratio of Weighted k-server is at least Exponential

02/22/2021
by   Nikhil Ayyadevara, et al.
0

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 article, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2022

The Randomized k-Server Conjecture is False!

We prove a few new lower bounds on the randomized competitive ratio for ...
research
10/01/2018

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics

The generalized k-server problem is an extension of the weighted k-serve...
research
07/16/2020

Memoryless Algorithms for the Generalized k-server Problem on Uniform Metrics

We consider the generalized k-server problem on uniform metrics. We stud...
research
03/22/2020

Complexity of randomized algorithms for underdamped Langevin dynamics

We establish an information complexity lower bound of randomized algorit...
research
03/28/2023

Online embedding of metrics

We study deterministic online embeddings of metrics spaces into normed s...
research
06/11/2022

Online Paging with Heterogeneous Cache Slots

It is natural to generalize the k-Server problem by allowing each reques...
research
10/03/2018

Towards Uniform Online Spherical Tessellations

The problem of uniformly placing N points onto a sphere finds applicatio...

Please sign up or login with your details

Forgot password? Click here to reset