Squared-logarithmic randomized k-server on arbitrary metrics

We prove that randomized k-server has competitive ratio $O((\log (k+1){)}^2)$ on every metric space against oblivious request sequences, matching the known worst-case lower bound. For each metric and initial configuration, one policy works for all finite request sequences, including on infinite and unbounded spaces. When the initial server positions are distinct, no additive term is needed.