{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article1118","name":"Topology Matters: Smoothed Competitiveness of Metrical Task Systems","abstract":"We consider online problems that can be modeled as metrical task systems: An online algorithm resides in a graph of n nodes and may move in this graph at a cost equal to the distance. The algorithm has to service a sequence of tasks that arrive over time; each task specifies for each node a request cost that is incurred if the algorithm services the task in this particular node. The objective is to minimize the total request plus travel cost. Borodin, Linial and Saks gave 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 add some random noise to the request costs and analyze the competitive ratio of WFA on the perturbed sequence. We prove upper and matching lower bounds. Our analysis reveals that the smoothed competitive ratio of WFA is much better than its (worst case) competitive ratio and that it depends on several topological parameters of the graph underlying the metric, such as maximum degree, diameter, etc. For example, already for moderate perturbations, the smoothed competitive ratio of WFA is O(log(n)) on a clique and O(\\sqrt{n}) on a line. We also provide the first average case analysis of WFA. For a large class of probability distributions, we prove that WFA has O(log(D)) expected competitive ratio, where D is the maximum degree of the underlying graph.","keywords":["online algorithm","metrical task systems","work function algorithm","smoothed competitive analysis"],"author":[{"@type":"Person","name":"Sch\u00e4fer, Guido","givenName":"Guido","familyName":"Sch\u00e4fer"},{"@type":"Person","name":"Sivadasan, Naveen","givenName":"Naveen","familyName":"Sivadasan"}],"position":29,"pageStart":1,"pageEnd":5,"dateCreated":"2005-05-30","datePublished":"2005-05-30","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Sch\u00e4fer, Guido","givenName":"Guido","familyName":"Sch\u00e4fer"},{"@type":"Person","name":"Sivadasan, Naveen","givenName":"Naveen","familyName":"Sivadasan"}],"copyrightYear":"2005","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/DagSemProc.05031.29","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume557","volumeNumber":5031,"name":"Dagstuhl Seminar Proceedings, Volume 5031","dateCreated":"2005-05-27","datePublished":"2005-05-27","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article1118","isPartOf":{"@type":"Periodical","@id":"#series119","name":"Dagstuhl Seminar Proceedings","issn":"1862-4405","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume557"}}}