Ambuehl, Christoph, Gaertner, Bernd and von Stengel, Bernhard ORCID: 0000-0002-3488-8322
(2010)
*Optimal projective algorithms for the list update problem.*
.
arXiv.org.

## 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.

Item Type: | Monograph (Report) |
---|---|

Official URL: | http://arxiv.org/ |

Additional Information: | © 2010 The authors |

Divisions: | Mathematics |

Subjects: | Q Science > QA Mathematics |

Sets: | Departments > Mathematics |

Date Deposited: | 23 Jan 2012 16:07 |

Last Modified: | 25 Apr 2021 23:08 |

URI: | http://eprints.lse.ac.uk/id/eprint/41656 |

### Actions (login required)

View Item |