The k-server problem is perhaps the most influential online problem: natural, crisp, with a
surprising technical depth that manifests the richness of competitive analysis. The k-server …

In practice, almost all dynamic systems require decisions to be made on-line, without full
knowledge of their future impact on the system. A general model for the processing of …

The paging problem is that of deciding which pages to keep in a memory of k pages in order
to minimize the number of page faults. We develop the marking algorithm, a randomized on …

Competitive analysis is concerned with comparing the performance of on-line algorithms
with that of optimal off-line algorithms. In some cases randomization can lead to algorithms …

During the last 15 years online algorithms have received considerable research interest. In
this survey we give an introduction to the competitive analysis of online algorithms and …

We prove that the work function algorithm for the k-server problem has a competitive ratio at
most 2 k− 1. Manasse et al.[1988] conjectured that the competitive ratio for the k-server …

An on-line algorithm is one that receives a sequence of requests and performs an immediate
action in response to each request. On-line algorithms arise in any situation where decisions …

This paper investigates a zero-sum game played on a weighted connected graph G
between two players, the tree player and the edge player. At each play, the tree player …

Over the past twelve years, online algorithms have received considerable research interest.
Online problems had been investigated already in the seventies and early eighties but an …

Weighted caching is a generalization of paging in which the cost to evict an item depends on
the item. We study both of these problems as restrictions of the well-known k-server problem …