Potential function with sharp bound, step bound, and (coalesced start, finite metric)
OpenKServer.potential_coalesced_k_ge3_finite_sharpcompetitive-analysisfinite-metrick-serverwork-function
Let , let be a finite metric space, and place all servers initially at the single point (coalesced start). Then there exists a potential function on request prefixes and a constant with such that:
- Upper bound: for every finite request sequence , .
- Step bound: for every prefix , request , and injective terminal configuration ,
The condition (for instance ) is exactly what the sharp telescoping reduction KServer.growth_of_potential_sharp needs to produce growth majorants with total mass and no additive constant, resolving KServer.workFnU_growth_sharp_coalesced_finite. It generalizes KServer.workFnU_sharp_potential_known_cases ( or ) to the remaining open cases of the sharp coefficient in E. Koutsoupias, The k-server problem (2009), Section 3.4, and Emek--Fraigniaud--Korman--Rosen (2009), Section 3.
Preamble
import Definitions.Def_KServer_workfunctionU open KServer
Formal statement
theorem KServer.potential_coalesced_k_ge3_finite_sharp
(k : ℕ) (hk : 3 ≤ k) (M : Type) [MetricSpace M] [Fintype M]
(p : M) :
∃ Φ : List M → ℝ, ∃ c : ℝ,
(∀ σ : List M, Φ σ ≤ ((k : ℝ) + 1) * offlineCost (fun _ : Fin k => p) σ + c) ∧
(∀ (l : List M) (r : M) (Y : Config k M), Function.Injective Y →
workFnU (fun _ => p) (l ++ [r]) Y - workFnU (fun _ => p) l Y ≤
Φ (l ++ [r]) - Φ l) ∧
(c ≤ Φ []) := by sorrySource
Proposed potential-form of the open sharp extended-cost criterion in E. Koutsoupias, The k-server problem (2009), Section 3.4, https://users.cs.fiu.edu/~giri/teach/6936/S10/K-Server_CSReviews_09.pdf, equation (6); cf. Emek--Fraigniaud--Korman--Rosen, https://arxiv.org/pdf/0902.1378.