On the power of randomization in on-line algorithms

S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson

Research output: Contribution to journalArticle

135 Citations (Scopus)

Abstract

Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient "simulation" of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases.

Original languageEnglish
Pages (from-to)2-14
Number of pages13
JournalAlgorithmica (New York)
Volume11
Issue number1
DOIs
Publication statusPublished - Jan 1994

Fingerprint

Randomisation
Deterministic Algorithm
Randomized Algorithms
Efficient Algorithms
Upper bound
Computing
Simulation

Keywords

  • Competitive analysis
  • Game theory
  • On-line algorithms
  • Randomized algorithms

ASJC Scopus subject areas

  • Applied Mathematics
  • Safety, Risk, Reliability and Quality
  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

On the power of randomization in on-line algorithms. / Ben-David, S.; Borodin, A.; Karp, R.; Tardos, G.; Wigderson, A.

In: Algorithmica (New York), Vol. 11, No. 1, 01.1994, p. 2-14.

Research output: Contribution to journalArticle

Ben-David, S, Borodin, A, Karp, R, Tardos, G & Wigderson, A 1994, 'On the power of randomization in on-line algorithms', Algorithmica (New York), vol. 11, no. 1, pp. 2-14. https://doi.org/10.1007/BF01294260
Ben-David, S. ; Borodin, A. ; Karp, R. ; Tardos, G. ; Wigderson, A. / On the power of randomization in on-line algorithms. In: Algorithmica (New York). 1994 ; Vol. 11, No. 1. pp. 2-14.
@article{a2ea42cd695d4a0a86197bd53ca60857,
title = "On the power of randomization in on-line algorithms",
abstract = "Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient {"}simulation{"} of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases.",
keywords = "Competitive analysis, Game theory, On-line algorithms, Randomized algorithms",
author = "S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson",
year = "1994",
month = "1",
doi = "10.1007/BF01294260",
language = "English",
volume = "11",
pages = "2--14",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - On the power of randomization in on-line algorithms

AU - Ben-David, S.

AU - Borodin, A.

AU - Karp, R.

AU - Tardos, G.

AU - Wigderson, A.

PY - 1994/1

Y1 - 1994/1

N2 - Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient "simulation" of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases.

AB - Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient "simulation" of randomized on-line algorithms by deterministic ones, which is best possible in general. The proof of the upper bound is existential. We deal with the issue of computing the efficient deterministic algorithm, and show that this is possible in very general cases.

KW - Competitive analysis

KW - Game theory

KW - On-line algorithms

KW - Randomized algorithms

UR - http://www.scopus.com/inward/record.url?scp=0028193049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028193049&partnerID=8YFLogxK

U2 - 10.1007/BF01294260

DO - 10.1007/BF01294260

M3 - Article

AN - SCOPUS:0028193049

VL - 11

SP - 2

EP - 14

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1

ER -