LIPIcs.STACS.2014.470.pdf
- Filesize: 0.63 MB
- 12 pages
Document
Randomized Online Algorithms with High Probability Guarantees
Authors
- Publication date: 2014-03-05
- License:
Creative Commons Attribution 3.0 Unported license
-
Part of:
Volume:
31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
Cite AsGet BibTex
Dennis Komm, Rastislav Královic, Richard Královic, and Tobias Mömke. Randomized Online Algorithms with High Probability Guarantees. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 470-481, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.STACS.2014.470
https://doi.org/10.4230/LIPIcs.STACS.2014.470
Abstract
We study the relationship between the competitive ratio and the tail distribution of randomized online problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected competitive ratio, another algorithm that achieves the same solution quality up to an arbitrarily small constant error with high probability; the "high probability" statement is in terms of the optimal cost. Furthermore, we show that our assumptions are tight in the sense that removing any of them allows for a counterexample to the theorem.
Keywords
- Online Algorithms
- Randomization
- High Probability
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads