Skip to main content
Article thumbnail
Location of Repository

Optimal projective algorithms for the list update problem

By Christoph Ambuehl, Bernd Gaertner and Bernhard von Stengel

Abstract

The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and TIMESTAMP(0). This and many other known algorithms, like MTF, are projective in the sense that they can be defined by looking only at any pair of list items at a time. Projectivity simplifies both the description of the algorithm and its analysis, and so far seems to be the only way to define a good online algorithm for lists of arbitrary length. In this paper we characterize all projective list update algorithms and show that their competitive ratio is never smaller than 1.6 in the partial cost model. Therefore, COMB is a best possible projective algorithm in this model

Topics: QA Mathematics
Publisher: arXiv.org
Year: 2010
OAI identifier: oai:eprints.lse.ac.uk:41656
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/ (external link)
  • http://eprints.lse.ac.uk/41656... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.