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 - http://www.scopus.com/inward/record.url?scp=0025112463&partnerID=8YFLogxK
U2 - 10.1145/100216.100268
DO - 10.1145/100216.100268
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0025112463
SN - 0897913612
SN - 9780897913614
T3 - Proc 22nd Annu ACM Symp Theory Comput
SP - 379
EP - 386
BT - Proc 22nd Annu ACM Symp Theory Comput
PB - Publ by ACM
T2 - Proceedings of the 22nd Annual ACM Symposium on Theory of Computing
Y2 - 14 May 1990 through 16 May 1990
ER -