Abstract
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [3] presented a deterministic work function algorithm (WFA) for metrical task systems having a tight competitive ratio of 2n-1. We present a smoothed competitive analysis of WFA. Given an adversarial task sequence, we smoothen the request costs by means of a symmetric additive smoothing model and analyze the competitive ratio of WFA on the smoothed task sequence. We prove upper and matching lower bounds on the smoothed competitive ratio of WFA. Our analysis reveals that the smoothed competitive ratio of WFA is much better than O(n) and that it depends on several topological parameters of the underlying graph G, such as the maximum degree D and the diameter. For example, already for small perturbations the smoothed competitive ratio of WFA reduces to O(log n) on a clique or a complete binary tree and to \(O(\sqrt{n})\) on a line. We also provide the first average case analysis of WFA showing that its expected competitive ratio is O(log(D)) for various distributions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Schäfer, G., Vredeveld, T.: Average case and smoothed competitive analysis of the multi-level feedback algorithm. In: Proceedings of the Forty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 462–471 (2003)
Borodin, A., Linial, N., Saks, M.: An optimal online algorithm for metrical task systems. Journal of the ACM 39, 745–763 (1992)
Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: ACM Symposium on Theory of Computing, pp. 322–333 (1988)
Motwani, R., Raghavan, P.: Randomized algorithms, 1st edn. Cambridge University Press, Cambridge (1995)
Schäfer, G., Sivadasan, N.: Topology matters: Smoothed competitiveness of metrical task systems. Technical Report MPI-I-2003-1-016, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2003)
Spielman, D., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In: ACM Symposium on Theory of Computing (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schäfer, G., Sivadasan, N. (2004). Topology Matters: Smoothed Competitiveness of Metrical Task Systems. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive