On the power of randomization in online algorithms

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

doi:10.1145/100216.100268

On the power of randomization in online algorithms

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

110 Scopus citations

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 language	English
Title of host publication	Proceedings of the twenty-second annual ACM symposium on Theory of Computing
Publisher	Publ by ACM
Pages	379-386
Number of pages	8
ISBN (Print)	0897913612, 9780897913614
DOIs	https://doi.org/10.1145/100216.100268
State	Published - 1990
Externally published	Yes
Event	22nd Annual ACM Symposium on Theory of Computing, STOC 1990 - Baltimore, MD, USA Duration: 14 May 1990 → 16 May 1990

Publication series

Name	Proceedings of the twenty-second annual ACM symposium on Theory of Computing

Conference

Conference	22nd Annual ACM Symposium on Theory of Computing, STOC 1990
City	Baltimore, MD, USA
Period	14/05/90 → 16/05/90

Access to Document

10.1145/100216.100268

Cite this

@inproceedings{7a912d50c90f47aa89757acf5606d4e0,

title = "On the power of randomization in online algorithms",

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

author = "S. Ben-David and R. Karp and A. Wigderson and A. Borodin and G. Tardos",

year = "1990",

doi = "10.1145/100216.100268",

language = "אנגלית",

isbn = "0897913612",

series = "Proceedings of the twenty-second annual ACM symposium on Theory of Computing",

publisher = "Publ by ACM",

pages = "379--386",

booktitle = "Proceedings of the twenty-second annual ACM symposium on Theory of Computing",

note = "22nd Annual ACM Symposium on Theory of Computing, STOC 1990 ; Conference date: 14-05-1990 Through 16-05-1990",

}

Ben-David, S, Karp, R, Wigderson, A, Borodin, A & Tardos, G 1990, On the power of randomization in online algorithms. in Proceedings of the twenty-second annual ACM symposium on Theory of Computing. Proceedings of the twenty-second annual ACM symposium on Theory of Computing, Publ by ACM, pp. 379-386, 22nd Annual ACM Symposium on Theory of Computing, STOC 1990, Baltimore, MD, USA, 14/05/90. https://doi.org/10.1145/100216.100268

On the power of randomization in online algorithms. / Ben-David, S.; Karp, R.; Wigderson, A. et al.
Proceedings of the twenty-second annual ACM symposium on Theory of Computing. Publ by ACM, 1990. p. 379-386 (Proceedings of the twenty-second annual ACM symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the power of randomization in online algorithms

AU - Ben-David, S.

AU - Karp, R.

AU - Wigderson, A.

AU - Borodin, A.

AU - Tardos, G.

PY - 1990

Y1 - 1990

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

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

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

U2 - 10.1145/100216.100268

DO - 10.1145/100216.100268

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0025112463

SN - 0897913612

SN - 9780897913614

T3 - Proceedings of the twenty-second annual ACM symposium on Theory of Computing

SP - 379

EP - 386

BT - Proceedings of the twenty-second annual ACM symposium on Theory of Computing

PB - Publ by ACM

T2 - 22nd Annual ACM Symposium on Theory of Computing, STOC 1990

Y2 - 14 May 1990 through 16 May 1990

ER -

On the power of randomization in online algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this