On the power of randomization in online algorithms

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

103 Citations (Scopus)

Abstract

Against an adaptive adversary, we show that the power of randomization in online algorithms is severely limited! We prove the existence of an efficient 'simulation' of randomized online 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
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Pages379-386
Number of pages8
ISBN (Print)0897913612, 9780897913614
DOIs
Publication statusPublished - 1990
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: May 14 1990May 16 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput

Other

OtherProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA
Period5/14/905/16/90

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ben-David, S., Karp, R., Wigderson, A., Borodin, A., & Tardos, G. (1990). On the power of randomization in online algorithms. In Proc 22nd Annu ACM Symp Theory Comput (pp. 379-386). (Proc 22nd Annu ACM Symp Theory Comput). Publ by ACM. https://doi.org/10.1145/100216.100268