Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials

TL;DR

This paper proves the work function algorithm is 3-competitive for the 3-server problem on circle metrics and demonstrates limitations of canonical potential functions in resolving the general deterministic 3-server conjecture.

Contribution

It introduces a new potential function for circle metrics and shows canonical potentials cannot settle the conjecture in general metric spaces.

Findings

Work function algorithm is 3-competitive on circle metrics.

Canonical potential functions are insufficient for the general conjecture.

Limitations of current analysis frameworks are identified.

Abstract

The deterministic $k$-server conjecture states that there is a $k$-competitive deterministic algorithm for the $k$-server problem for any metric space. We show that the work function algorithm is $3$-competitive for the $3$-server problem on circle metrics, a case left open by Coester and Koutsoupias (2021). Our analysis follows the existing framework but introduces a new potential function which may be viewed as a relaxation of the counterpart by Coester and Koutsoupias (2021). We further notice that the new potential function and many existing ones can be rewritten in a canonical form. Through a computer-aided verification, however, we find that no such canonical potential function can resolve the deterministic $3$-server conjecture for general metric spaces under the current analysis framework.