A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
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