Randomized Competitive Analysis for Two-Server Problems

@inproceedings{Bein2008RandomizedCA,
  title={Randomized Competitive Analysis for Two-Server Problems},
  author={Wolfgang W. Bein and Kazuo Iwama and Jun Kawahara},
  booktitle={ESA},
  year={2008}
}
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5949. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).