@inproceedings{bhattacharya2014coordination,
author = {Bhattacharya, Sayan and Kulkarni, Janardhan (Jana) and Mirrokni, Vahab},
title = {Coordination Mechanisms for Selfish Routing over Time on a Tree},
year = {2014},
month = {July},
abstract = {While selfish routing has been studied extensively, the problem of designing better coordination mechanisms for routing over time in general graphs has remained an open problem. In this paper, we focus on tree networks (single source multiple destinations) with the goal of minimizing (weighted) average sojourn time of jobs, and provide the first coordination mechanisms with provable price of anarchy for this problem. Interestingly, we achieve our price of anarchy results using simple and strongly local policies such as Shortest Job First and the Smith’s Rule (also called HDF). In particular, for the case of unweighted jobs, we design a coordination mechanism with polylogarithmic price of anarchy. For weighted jobs, on the other hand, we show that price of anarchy is a function of the depth of the tree and accompany this result by a lower bound for the price of anarchy for the Smith Rule policy and other common strongly local scheduling policies. Our price of anarchy results also imply improved approximation algorithms for the underlying optimization problem of routing over a tree. This problem is well motivated from applications of routing in supercomputers and data center networks where average sojourn time is an important metric.},
publisher = {Springer Berlin Heidelberg},
url = {http://approjects.co.za/?big=en-us/research/publication/coordination-mechanisms-selfish-routing-time-tree/},
}