arXiv (OAI Expanded)
open access
The $k$-server conjecture is true
The $k$-server conjecture states that a deterministic online algorithm can achieve competitive ratio $k$ on every metric space. We prove the conjecture. Specifically, we show that the work function algorithm satisfies it. Our proof uses a natural algebraic representation of the work function as a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Dicey games: Shared sources of randomness in distributed systems#449044
- Resource Allocation with Karma Mechanisms#139077
- The Fixed Server Locality Gap of Count Load Assignment Games#1084434
- Optimal Analysis of Greedy for Stochastic Online Euclidean Matching#1050136
- Generalized bidding games: Where bidding and stochastic games meet#1146755
Record · ID 1110002
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive