, Volume 11, Issue 1, pp 2–14

On the power of randomization in on-line algorithms

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

DOI: 10.1007/BF01294260

Cite this article as:
Ben-David, S., Borodin, A., Karp, R. et al. Algorithmica (1994) 11: 2. doi:10.1007/BF01294260


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.

Key words

On-line algorithmsCompetitive analysisRandomized algorithmsGame theory

Copyright information

© Springer-Verlag New York Inc. 1994

Authors and Affiliations

  • S. Ben-David
    • 1
  • A. Borodin
    • 2
  • R. Karp
    • 3
  • G. Tardos
    • 4
  • A. Wigderson
    • 5
  1. 1.TechnionHaifaIsrael
  2. 2.Department of Computer ScienceUniversity of TorontoTorontoCanada
  3. 3.University of California at Berkeley and International Computer Science InstituteBerkeleyUSA
  4. 4.Eötvös UniversityBudapestHungary
  5. 5.Hebrew UniversityJerusalemIsrael