On-line choice of on-line algorithms

Yossi Azar; Andrei Z. Broder; Mark S. Manasse

On-line choice of on-line algorithms

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

^*Corresponding author for this work

Hewlett-Packard

Research output: Contribution to conference › Paper › peer-review

28 Scopus citations

Abstract

Let {A₁,A₂,...,A_m} 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 A_i has a competitive ratio a_i 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 language	English
Pages	432-440
Number of pages	9
State	Published - 1993
Externally published	Yes
Event	Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, USA Duration: 25 Jan 1993 → 27 Jan 1993

Conference

Conference	Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
City	Austin, TX, USA
Period	25/01/93 → 27/01/93

Cite this

@conference{eefe4e446e8c4d109856b8603cd770e2,

title = "On-line choice of on-line algorithms",

abstract = "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.",

author = "Yossi Azar and Broder, \{Andrei Z.\} and Manasse, \{Mark S.\}",

year = "1993",

language = "אנגלית",

pages = "432--440",

note = "Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 25-01-1993 Through 27-01-1993",

}

TY - CONF

T1 - On-line choice of on-line algorithms

AU - Azar, Yossi

AU - Broder, Andrei Z.

AU - Manasse, Mark S.

PY - 1993

Y1 - 1993

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

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

UR - https://www.scopus.com/pages/publications/0027187421

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0027187421

SP - 432

EP - 440

T2 - Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 25 January 1993 through 27 January 1993

ER -

On-line choice of on-line algorithms

Abstract

Conference

Other files and links

Fingerprint

Cite this