The maximum latency of selfish routing

We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In single-commodity networks with unrestricted latency functions, we prove that this worst-case price of anarchy is exactly n - 1, where n is the number of network vertices. For Braess's Paradox in such networks, we prove that removing at most c edges from a network decreases the

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Tim Roughgarden
• Keywords: Algorithms, Braess's Paradox, Maximum Latency Objective, SODA 2004, Unrestricted Latency Functions