The Work Function Algorithm for metrical task systems. Apr 3 12:04 2002 Let M be a metrical task system. The work function algorithm (WFA) is a deterministic online algorithm, defined as follows. If r^t is the request at step t, and if w^t is the work function at step t, and if x^{t-1} is the state of WFA at step t-1, then WFA chooses x^t so that: 1. x^t is in the support of w^t 2. ||x^{t-1} + x^t|| + w^t(x^t) is minimized We remark that this definition of WFA agrees with the classic definition of WFA for the server problem. It is known that, for the k-server problem, WFA is 2k-1 competitive, regardless of the cardinality of the metric space. For k = 2, WFA is 2-competitive. WFA is k-competitive for certain specific classes of metric spaces, as well. The competitiveness of WFA for the k-server problem is conjectured to be k in general. Theorem: If M has n states, then WFA is 2n-1 competitive. Proof: Let x_1, ... x_n be the states. Let Phi be the potential defined by Phi(w,x_i) .... (Unfinished)