Random walks on weighted graphs, and applications to on-line algorithms

D. Coppersmith, P. Doyle, P. Raghavan, M. Snir
1990 Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90  
We study the design and analysis of randomized on-line algorithms. We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges. We develop a theory for the synthesis of such walks, and employ it to design competitive on-line algorithms.
doi:10.1145/100216.100266 dblp:conf/stoc/CoppersmithDRS90 fatcat:sumfy2hprzbyjmc2qobtfzpz5m