On-line choice of on-line algorithms

Yossi Azar*, Andrei Z. Broder, Mark S. Manasse

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

25 Scopus citations


Let {A1,A2,...,Am} be a set of on-line algorithms for a problem P with input set I. We assume that P can be represented as a metrical task system. Each Ai has a competitive ratio ai with respect to the optimum off-line algorithm, but only for a subset of the possible inputs such that the union of these subsets covers I. Given this setup, we construct a generic deterministic on-line algorithm and a generic randomized on-line algorithm for P that are competitive over all possible inputs. We show that their competitive ratios are optimal up to constant factors. Our analysis proceeds via an amusing card game.

Original languageEnglish
Number of pages9
StatePublished - 1993
Externally publishedYes
EventProceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, USA
Duration: 25 Jan 199327 Jan 1993


ConferenceProceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
CityAustin, TX, USA


Dive into the research topics of 'On-line choice of on-line algorithms'. Together they form a unique fingerprint.

Cite this