We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where Hk = Pk i=1 1 i , the kth harmonic number. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 108 . The algorithm is better by a factor of 2 if k < 47. Key words: Design of Algorithms, Online Algorithms, Randomized Algorithms
Wolfgang W. Bein, Lawrence L. Larmore, John Noga