• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

How bad is selfish routing? (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.ust.hk]
  • [www.cs.cuhk.hk]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cornell.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.huji.ac.il]
  • [www.cs.northwestern.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.brown.edu]
  • [theory.stanford.edu]
  • [www.cs.stanford.edu]
  • [www.cs.cornell.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Tim Roughgarden , Éva Tardos
Venue:JOURNAL OF THE ACM
Citations:403 - 25 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Roughgarden02howbad,
    author = {Tim Roughgarden and Éva Tardos},
    title = {How bad is selfish routing?},
    journal = {JOURNAL OF THE ACM},
    year = {2002},
    volume = {49},
    number = {2},
    pages = {236--259}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times—the total latency—is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance. In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and nondecreasing in the edge congestion. Here, the total

Citations

8881 D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
2172 The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
1950 Computational Complexity - Papadimitriou - 1995
1584 Game Theory - Fudenberg, Tirole - 1991
1517 Data Network - Bertsekas, Gallager - 1992
1493 Random Graphs - Bollobas - 2001
1346 Renyi A: On the evolution of random graphs - Erdos - 1960
1117 Reducability Among Combinatorial Problems - Karp - 1972
1107 Network flows: theory, algorithms and applications - Ahuja, Magnanti, et al. - 1993
969 Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
583 Non-Cooperative Games - Nash - 1951
557 Data Structures and Network Algorithms - Tarjan - 1983
483 C.H.: Worst-case equilibria - Koutsoupias, Papadimitriou - 1999
480 Algorithmic mechanism design - Nisan, Ronen
446 The Linear Complementarity Problem - Cottle, Pang, et al. - 1992
372 HM: A second course in stochastic processes - Karlin, Taylor - 1981
349 Dynamic Noncooperative Game Theory - Basar, Olsder - 1995
307 A class of games possessing pure-strategy Nash equilibria - Rosenthal - 1973
307 Some theoretical aspects of road traffic research - Wardrop - 1952
293 An Engineering Approach to Computer Networking - Keshav - 1997
282 The Economics of Welfare - Pigou - 1920
236 Fundamentals of Queueing Theory - Gross, Harris - 1985
231 the internet - Papadimitriou, games - 2001
230 Potential games - Monderer, Shapley - 1996
217 Sharing the cost of multicast transmissions - Feigenbaum, Papadimitriou, et al.
209 Building Secure and Reliable Network Applications - Birman - 1996
192 Game Theory - Owen - 1995
185 Pricing in computer networks: Reshaping the research agenda - Shenkar, Clark, et al. - 1996
174 Making greed work in networks: A game theoretical analysis of switch service disciplines - Shenker - 1994
171 Existence and Uniqueness of equilibrium points for concave n-person games - Rosen - 1965
160 K.: Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
148 Competitive routing in multi-user communication networks - Orda, Rom, et al. - 1993
142 The price of anarchy is independent of the network topology - Roughgarden
134 The Directed Subgraph Homeomorphism Problem - Fortune, Hopcroft, et al. - 1980
131 B.: Tight bounds for worst-case equilibria - Czumaj, Vöcking - 2007
121 Recommendations on queue management and congestion avoidance in the internet - Braden, Clark, et al. - 1998
116 Optimal time-critical scheduling via resource augmentation - Phillips, Stein, et al. - 1997
114 The design and analysis of algorithms - Kozen - 1991
107 The primal-dual method for approximation algorithms - Williamson
107 Congestion games with player specific pay-off functions - Milchtaich - 1996
101 Network Optimization: Continuous and Discrete Models, Athena Scientific - Bertsekas - 1998
99 P.G.: The price of selfish routing - Mavronicolas, Spirakis - 2007
99 The recognition of series parallel digraphs - Valdes, Tarjan, et al. - 1982
89 The traffic assignment problem for a general network - Dafermos, Sparrow - 1969
89 Stackelberg scheduling strategies - Roughgarden
88 A Mathematical View of Interior-Point Methods in Convex Optimization - RENEGAR - 1999
83 Achieving Network Optima Using Stackelberg Routing Strategies - Korilis, Lazar, et al. - 1997
82 Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods - Sheffi - 1978
82 Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions - Vetta - 2002
72 Network design and transportation planning: Models and algorithms - Magnanti, Wong - 1984
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University