k-server-bench formulates potential-function discovery for the k-server conjecture as a code-based inequality-satisfaction task; current agents fully solve the resolved k=3 case and reduce violations on the open k=4 case.
"" Maps ‘config‘ (a tuple of point indices) to its index in the work-function vector, i.e., w(C) = wf[idx] where config_to_idx(C) = idx
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture
k-server-bench formulates potential-function discovery for the k-server conjecture as a code-based inequality-satisfaction task; current agents fully solve the resolved k=3 case and reduce violations on the open k=4 case.