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

139 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
Volume11
Issue number1
DOIs
Publication statusPublished - Jan 1 1994

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On the power of randomization in on-line algorithms'. Together they form a unique fingerprint.

  • Cite this

    Ben-David, S., Borodin, A., Karp, R., Tardos, G., & Wigderson, A. (1994). On the power of randomization in on-line algorithms. Algorithmica, 11(1), 2-14. https://doi.org/10.1007/BF01294260