Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Journal of the ACM (JACM)
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Algorithmic Game Theory
Fast, Fair, and Efficient Flows in Networks
Operations Research
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Atomic routing games on maximum congestion
Theoretical Computer Science
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing
Wardrop equilibria and price of stability for bottleneck games with splittable traffic
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
Operations Research Letters
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study the price of anarchy of selfish routing with variable traffic rates and when the path cost is a nonadditive function of the edge costs. Nonadditive path costs are important, for example, in networking applications, where a key performance metric is the achievable throughput along a path, which is controlled by its bottleneck (most congested) edge. We prove the following results. In multicommodity networks, the worst-case price of anarchy under the ℓp path cost with 1 p ≤∞ can be dramatically larger than under the standard ℓ1 path cost. In single-commodity networks, the worst-case price of anarchy under the ℓp path cost with 1 p ∞ is no more than with the standard ℓ1 path norm. (A matching lower bound follows trivially from known results.) This upper bound also applies to the ℓ∞ path cost if and only if attention is restricted to the natural subclass of equilibria generated by distributed shortest path routing protocols. For a natural cost-minimization objective function, the price of anarchy with endogenous traffic rates (and under any ℓp path cost) is no larger than that in fixed-demand networks. Intuitively, the worst-case inefficiency arising from the “tragedy of the commons” is no more severe than that from routing inefficiencies. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 (An extended abstract of this article appeared in the Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2006.)