The price of selfish routing
Date
2001Source
Conference Proceedings of the Annual ACM Symposium on Theory of Computing33rd Annual ACM Symposium on Theory of Computing
Pages
510-519Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
The problem of routing in congested communication networks was studied. A noncooperative network consisting of a set of m parallel links within a game theoretic framework was considered for analysis. A collection of n network users each employing a mixed strategy to control assigned traffic was assumed. Both uniform and nonuniform link capacities were considered for routing traffic in order to minimize the maximum expected latency over all links.