The Community for Technology Leaders
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference (1997)
Ulm GERMANY
June 24, 1997 to June 27, 1997
ISSN: 1093-0159
ISBN: 0-8186-7907-7
pp: 226
A. Borodin , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
R. El-Yaniv , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
ABSTRACT
This paper concerns two fundamental but somewhat neglected issues both related to the design and analysis of randomized online algorithms. Motivated by early results in game theory we define several types of randomized online algorithms discuss known conditions for their equivalence and give a natural example distinguishing between two kinds of randomizations. In particular we show that mixed randomized memoryless paging algorithms can achieve strictly better competitive performance than behavioral randomized algorithms. Next we summarize known-and derive new-"Yao Principle" theorems for lower bounding competitive ratios of randomized online algorithms. This leads to six different theorems for bounded/unbounded and minimization/maximization problems.
INDEX TERMS
randomised algorithms; randomization; online computation; randomized online algorithms; game theory; paging algorithms; competitive performance; Yao Principle; minimization; maximization
CITATION

A. Borodin and R. El-Yaniv, "On Randomization In Online Computation," Proceedings of Computational Complexity. Twelfth Annual IEEE Conference(CCC), Ulm GERMANY, 1997, pp. 226.
doi:10.1109/CCC.1997.612318
89 ms
(Ver 3.3 (11022016))