An algorithm for the 2-server problem is called lazy if it never moves the other server, that is the server that is not being used to serve the current request. Without loss of generality, the adversary is lazy. However, it is frequently useful to assume that the adversary has moved the other server to some other point in M.