The generalized work function algorithm is competitive for the generalized 2-server problem Rene Sitters On the blackboard I will sketch the proof that is written here: http://arxiv.org/abs/1110.6600 This improves a result from 2006 by Leen Stougie and myself. The generalized 2-server problem is interesting for building a general theory on online optimization and may help to solve other fundamental online problems such as the randomized k-server problem or the dynamic search tree conjecture.