About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of the ACM (JACM)
Paper
Random Walks on Weighted Graphs and Applications to on-line Algorithms
Abstract
The design and analysis of randomized on-line algorithms are studied. This problem is shown to be closely related to the synthesis of random wdlks on graphs with positive real costs on their edges. A theory is developed for the synthesis of such wdlks, and it is employed to design competitive on-line algorithms. © 1993, ACM. All rights reserved.