This paper proposes a new method for probabilistic analysis of online algorithms. It is based on the notion of stochastic dominance. We develop the method for the online bin coloring problem introduced in [15]. Using methods for the stochastic comparison of Markov chains we establish the result that the performance of the online algorithm is stochastically better than the performance of the algorithm for any number of items processed. This result gives a more realistic picture than competitive analysis and explains the behavior observed in simulations. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hiller, B., & Vredeveld, T. (2008). Probabilistic analysis of online bin coloring algorithms via stochastic comparison. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 528–539). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_44
Mendeley helps you to discover research relevant for your work.