The Price of Selfish Routing


== Abstract ==

We study the problem of routing traffic through a congested network. We focus on the simplest case of a network consisting of m parallel links. We assume a collection of n network users each user employs a mixed strategy, which is a probability distribution over links, to control the shipping of its own assigned traffic. Given a capacity for each link specifying the rate at which the link processes traffic, the objective is to route traffic so that the maximum (over all links) latency is minimized. We consider both uniform and arbitrary link capacities. How much decrease in global performace is necessary due to the absence of some central authority to regulate network traffic and implement an optimal assignment of traffic to links? We investigate this fundamental question in the context of Nash equilibria for such a system, where each network user selfishly routes its traffic only on those links available to it that minimize its expected latency cost, given the network congestion caused by the other users. We use the Coordination Ratio, originally defined by Koutsoupias and Papadimitriou, as a measure of the cost of lack of coordination among the users roughly speaking, the Coordination Ratio is the ratio of the expectation of the maximum (over all links) latency in the worst possible Nash equilibrium, over the least possible maximum latency had global regulation been available. Our chief instrument is a set of combinatorial Minimum Expected Latency Cost Equations, one per user, that characterize the Nash equilibria of this system. These are linear equations in the minimum expected latency costs, involving the user traffics, the link capacities, and the routing pattern determined by the mixed strategies. In turn, we solve these equations in the case of fully mixed strategies, where each user assigns its traffic with a strictly positive probability to every link, to derive the first existence and uniqueness results for fully mixed Nash equilibria in this setting. Through a thorough analysis and characterization of fully mixed Nash equilibria, we obtain tight upper bounds of no worse than O(ln n/ln ln n) on the Coordination Ratio for (i) the case of uniform capacities and arbitrary traffics and (ii) the case of arbitrary capacities and identical traffics. © Springer 2007. 48 1 91 126 <p>Cited By :41


== Original document ==

The different versions of the original document can be found in:

* [http://gnosis.library.ucy.ac.cy/handle/7/54526 http://gnosis.library.ucy.ac.cy/handle/7/54526]

* [http://gnosis.library.ucy.ac.cy/handle/7/54527 http://gnosis.library.ucy.ac.cy/handle/7/54527]

* [http://link.springer.com/content/pdf/10.1007/s00453-006-0056-1.pdf http://link.springer.com/content/pdf/10.1007/s00453-006-0056-1.pdf],
: [http://link.springer.com/article/10.1007/s00453-006-0056-1/fulltext.html http://link.springer.com/article/10.1007/s00453-006-0056-1/fulltext.html],
: [http://link.springer.com/content/pdf/10.1007/s00453-006-0056-1 http://link.springer.com/content/pdf/10.1007/s00453-006-0056-1],
: [http://dx.doi.org/10.1007/s00453-006-0056-1 http://dx.doi.org/10.1007/s00453-006-0056-1] under the license http://www.springer.com/tdm

* [http://www.cs.ucy.ac.cy/~mavronic/pdf/nashAlgorithmica.pdf http://www.cs.ucy.ac.cy/~mavronic/pdf/nashAlgorithmica.pdf],
: [https://dblp.uni-trier.de/db/conf/stoc/stoc2001.html#MavronicolasS01 https://dblp.uni-trier.de/db/conf/stoc/stoc2001.html#MavronicolasS01],
: [https://doi.acm.org/10.1145/380752.380846 https://doi.acm.org/10.1145/380752.380846],
: [https://dl.acm.org/citation.cfm?id=380752.380846 https://dl.acm.org/citation.cfm?id=380752.380846],
: [https://academic.microsoft.com/#/detail/2030914480 https://academic.microsoft.com/#/detail/2030914480]

* [http://www.springerlink.com/index/pdf/10.1007/s00453-007-9047-0 http://www.springerlink.com/index/pdf/10.1007/s00453-007-9047-0],
: [http://dx.doi.org/10.1007/s00453-007-9047-0 http://dx.doi.org/10.1007/s00453-007-9047-0]

* [https://link.springer.com/article/10.1007/s00453-006-0056-1 https://link.springer.com/article/10.1007/s00453-006-0056-1],
: [https://core.ac.uk/display/101544573 https://core.ac.uk/display/101544573],
: [https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica48.html#MavronicolasS07 https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica48.html#MavronicolasS07],
: [https://academic.microsoft.com/#/detail/2070975056 https://academic.microsoft.com/#/detail/2070975056]

* [http://dl.acm.org/ft_gateway.cfm?id=380846&amp;ftid=66206&amp;dwn=1 http://dl.acm.org/ft_gateway.cfm?id=380846&amp;ftid=66206&amp;dwn=1],
: [http://dx.doi.org/10.1145/380752.380846 http://dx.doi.org/10.1145/380752.380846]



DOIS: 10.1007/s00453-007-9047-0 10.1145/380752.380846 10.1007/s00453-006-0056-1