Tim Roughgarden  Home/Search
Context Related
| cornell.edu/timr/papers/thesis.ps From: cornell.edu/timr/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This dissertation assumes relatively few prerequisites. Foremost, we expect the reader to be comfortable with basic concepts of network flow theory, such as flows, cuts, and path decompositions. Our favorite reference for this material is Tarjan [179]. On occasion we assume a nodding acquaintance with the theory of NPcompleteness, for which standard references include Garey and Johnson [77] and Papadimitriou [141], and with the basics of linear and nonlinear programming; accessible... (Update)
Context of citations to this paper: More
...problem of allocating link capacities at routing decisions. In [KO99] they suggest a congestion based pricing scheme. Roughgarden [Rou02] quantifies the worst possible loss in network performance arising from non cooperative routing behavior. In [YMR00] Ya che et.al....
Cited by: More
Equilibrium Analysis of Packet Forwarding Strategies in .. - Felegyhazi, Hubaux.. (2003) (Correct)
Exponentially Many Steps for Finding a Nash Equilibrium in.. - Savani, von Stengel (2004) (Correct)
Equilibrium Analysis of Packet Forwarding Strategies in .. - Felegyhazi, Buttyan.. (2003) (Correct)
Active bibliography (related documents): More All
4.2: How Bad is Selfish Routing? - Roughgarden, Tardos (2001) (Correct)
2.4: Designing Networks for Selfish Users is Hard - Roughgarden (2002) (Correct)
2.2: Stackelberg Scheduling Strategies - Roughgarden (2001) (Correct)
Similar documents based on text: More All
0.5: Bounding the Inefficiency of Equilibria in Nonatomic.. - Roughgarden, Tardos (2002) (Correct)
0.5: The Price of Anarchy is Independent of the Network Topology - Roughgarden (2002) (Correct)
Related documents from co-citation: More All
2: The Ecology of Cooperation (context) - Hoffmann - 2001
2: Network assisted power control for wireless data - Goodman, Mandayam - 2000
2: Cooperation in wireless ad hoc networks - Srinivasan, Nuggehalli et al. - 2003
BibTeX entry: (Update)
T. Roughgarden, "Selfish Routing," PhD. Thesis, Cornell University, May 2002 http://citeseer.ist.psu.edu/roughgarden02selfish.html More
@misc{ roughgarden02selfish,
author = "T. Roughgarden",
title = "Selfish Routing",
text = "T. Roughgarden, Selfish Routing, PhD. Thesis, Cornell University, May 2002",
year = "2002",
url = "citeseer.ist.psu.edu/roughgarden02selfish.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
951 Computational Complexity (context) - Papadimitriou - 1994
773 Reducibility among combinatorial problems (context) - Karp - 1972
370 Network Flows: Theory (context) - Ahuja, Magnanti et al. - 1993
309 Game Theory (context) - Fudenberg, Tirole - 1991
283 Random Graphs (context) - Bollobas - 1985
267 The Linear Complementarity Problem (context) - Cottle, Pang et al. - 1992
258 Data Structures and Network Algorithms (context) - Tarjan - 1983
170 Dynamic Noncooperative Game Theory (context) - Basar, Olsder - 1999
137 Algorithmic mechanism design - Nisan, Ronen - 2001
132 the evolution of random graphs (context) - Erdos, Renyi - 1960
130 Pricing in computer networks: Reshaping the research agenda - Shenker, Clark et al. - 1996
130 Building Secure and Reliable Network Applications - Birman - 1996
125 Non-cooperative games (context) - Nash - 1951
122 Making greed work in networks: A game-theoretic analysis of .. - Shenker - 1995
117 An Engineering Approach to Computer Networking (context) - Keshav - 1997
113 Competitive routing in multi-user communication networks - Orda, Rom et al. - 1993
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
88 A Second Course in Stochastic Processes (context) - Karlin, Taylor - 1981
87 How bad is selfish routing (context) - Roughgarden, Tardos - 2002
85 Worst-case equilibria - Koutsoupias, Papadimitriou - 1999
84 Design and Analysis of Algorithms (context) - Kozen - 1992
84 Game Theory (context) - Owen - 1995
82 Existence and uniqueness of equilibrium points for concave N.. (context) - Rosen - 1965
74 The recognition of series parallel digraphs (context) - Valdes, Tarjan et al. - 1982
69 and the Internet (context) - Papadimitriou, games - 2001
66 Linear Programming (context) - Chvatal - 1983
65 The primal-dual method for approximation algorithms and its .. (context) - Goemans, Williamson - 1997
63 The directed subgraph homeomorphism problem (context) - Fortune, Hopcroft et al. - 1980
55 the relationship between Nash-Cournot and Wardrop equilibria (context) - Haurie, Marcotte - 1985
54 Optimal time-critical scheduling via resource augmentation - Phillips, Stein et al. - 2002
52 A class of games possessing pure-strategy Nash equilibria (context) - Rosenthal - 1973
52 Studies in the Economics of Transportation (context) - Beckmann, McGuire et al. - 1956
44 Capacity allocation under noncooperative routing - Korilis, Lazar et al. - 1997
42 The Mathematics of Nonlinear Programming (context) - Peressini, Sullivan et al. - 1988
40 Tight bounds for worst-case equilibria - Czumaj, Vocking - 2002
39 Achieving network optima using Stackelberg routing strategie.. - Korilis, Lazar et al. - 1997
37 Virtual path bandwidth allocation in multiuser networks - Lazar, Orda et al. - 1997
35 A Mathematical View of Interior-Point Methods in Convex Opti.. (context) - Renegar - 2001
33 The economics of welfare (context) - Pigou - 1920
33 The price of selfish routing (context) - Mavronicolas, Spirakis - 2001
32 Designing networks for selfish users is hard - Roughgarden - 2001
32 Network design and transportation planning: Models and algor.. (context) - Magnanti, Wong - 1984
32 Competitive routing in networks with polynomial costs - Altman, Basar et al. - 2000
32 Avoiding the Braess paradox in noncooperative networks - Korilis, Lazar et al. - 1999
31 Some theoretical aspects of road tra#c research (context) - Wardrop - 1952
26 Mathematics of Operations Research (context) - Dubey, ciency et al. - 1986
25 An iterative algorithm to determine the dynamic user equilib.. - Gawron - 1998
24 A paradox of congestion in a queuing network (context) - Cohen, Kelly - 1990
24 The price of anarchy is independent of the network topology - Roughgarden - 2002
24 Pathways to Solutions (context) - Garcia, Zangwill - 1981
23 Network Optimization: Continuous and Discrete Models (context) - Bertsekas - 1998
22 Cambridge University Press (context) - Korner, of - 1996
21 Stackelberg scheduling strategies - Roughgarden - 2001
21 al games. Games and Economic Behavior (context) - Monderer, Shapley - 1996
20 Congestion resulting from increased capacity in single-serve.. (context) - Cohen, Je - 1997
20 Equilibria on a congested transportation network (context) - Aashtiani, Magnanti - 1981
18 Algorithms for selfish agents: Mechanism design for distribu.. - Nisan - 1999
18 Braess's paradox in a loss network (context) - Bean, Kelly et al. - 1997
18 Braess's paradox in a queueing network with state-dependent .. (context) - Calvert, Solomon et al. - 1997
18 Uber ein paradoxon der verkehrsplanung (context) - Braess - 1968
16 Mathematical Programming (context) - Frank, Paradox - 1981
16 Equilibrium points of nonatomic games (context) - Schmeidler - 1973
15 Nonlinear cost network models in transportation analysis (context) - Florian - 1986
15 A game theoretic perspective to flow control in telecommunic.. (context) - Douligeris, Mazumdar - 1992
14 assignment problem for a general network (context) - Dafermos, Sparrow - 1969
14 Mixed equilibrium for multiclass routing games - Boulogne, Altman et al. - 2000
14 The prevalence of Braess' paradox (context) - Steinberg, Zangwill - 1983
13 Network equilibrium models and algorithms (context) - Florian, Hearn - 1995
13 Braess-like paradoxes in distributed computer systems - Kameda, Altman et al. - 2000
13 Routing into two parallel links: Game-theoretic distributed .. - Altman, Basar et al. - 2001
12 Properties of the equilibrium state in transportation networ.. (context) - Hall - 1978
11 Urban Transportation Networks: Equilibrium Analysis with Mat.. (context) - She - 1985
11 How unfair is optimal routing (context) - Roughgarden - 2002
11 Second corrected edition (context) - Grotschel, Lovasz et al. - 1993
11 The network equilibrium problem in integers (context) - Rosenthal - 1973
10 Algorithms for rational agents - Ronen - 2000
10 Dynamics and rationality in ordered externality games (context) - Friedman - 1996
10 Sensitivity analysis for the asymmetric network equilibrium .. (context) - Dafermos, Nagurney - 1984
9 Mathematical Association of America (context) - Stra, Theory - 1993
9 A generic analysis of selfish routing (context) - Friedman - 2001
9 More paradoxes in the equilibrium assignment problem (context) - Fisk - 1979
9 Multilevel flow control of queues (context) - Douligeris, Mazumdar - 1989
9 with applications to facility location (context) - Vetta, in - 2002
9 Braess's paradox and power-law nonlinearities in networks - Calvert, Keady - 1993
9 Atomic resource sharing in noncooperative networks - Libman, Orda - 2001
8 Braess's paradox of tra#c flow (context) - Murchland - 1970
8 An algorithm for the discrete network design problem (context) - LeBlanc - 1975
8 Paradoxes in performance optimization of distributed systems - Kameda, Altman et al. - 2000
8 Graphentheoretische Methoden und ihre Anwendungen (context) - Knodel - 1969
7 allocation for server farms (context) - Czumaj, Krysta et al. - 2002
7 equilibrium and variational inequalities (context) - Dafermos - 1980
7 Avoiding paradoxes in routing games - Altman, Azouzi et al. - 2001
7 Queueing Theory (context) - Gross, Harris - 1998
7 Some fallacies in the interpretation of social cost (context) - Knight - 1924
6 Equilibria for multiclass routing in multi-agent networks - Altman, Kameda - 2001
6 Congestion games with player-specific payo# functions (context) - Milchtaich - 1996
6 uniqueness and stability of tra#c equilibria (context) - Smith - 1979
6 Exact and approximate algorithms for optimal network design (context) - Dionne, Florian - 1979
6 Optimal time-varying flows on congested networks (context) - Carey - 1987
6 University of Michigan Press (context) - Rapoport, Chammah - 1965
6 Road to ruin (context) - Bass - 1992
6 the algebra of networks (context) - Bott, Du et al. - 1953
6 A direct proof of the existence of pure strategy equilibria .. (context) - Rath - 1992
5 The price of anarchy in networks with polynomial edge latenc.. (context) - Roughgarden - 2001
5 equilibrium theory paradoxes (context) - Dafermos, Nagurney et al. - 1984
5 Stable flows in transportation networks - Nesterov - 1999
5 Performance of user equilibria in tra#c networks (context) - Schulz, Moses - 2001
5 Stable dynamics in transportation systems (context) - Nesterov, De Palma - 2000
5 Cowles Foundation (context) - Quint, Shubik et al. - 1994
5 The existence of equivalent mathematical programs for certai.. (context) - Bennett - 1993
5 The prevalence of paradoxes in transportation equilibrium pr.. (context) - Steinberg, Stone - 1988
5 Priority load sharing: An approach using Stackelberg games (context) - Economides, Silvester - 1990
5 A game-theoretic approach to network equilibrium (context) - Haurie, Marcotte - 1986
5 Topology of series-parallel networks (context) - Du - 1965
4 Convex separable optimization is not much harder than linear.. (context) - Hochbaum, Shanthikumar - 1990
4 A method for computing network equilibrium with elastic dema.. (context) - Florian, Nguyen - 1974
4 Characterizing Braess's paradox for tra#c networks (context) - Hagstrom, Abrams - 2001
4 The optimal network problem: Some computational procedures (context) - Scott - 1969
4 ciency of equilibria in nonatomic congestion games (context) - Roughgarden, Tardos et al. - 2002
4 Solutions to the optimal network design problem with shipmen.. (context) - Boyce, Soberanes - 1979
4 A computational approach to the selection of an optimal netw.. (context) - Hoc - 1973
4 Sustainable Transportation Networks (context) - Nagurney - 2000
4 Marktform und Gleichgewicht (context) - von Stackelberg - 1934
4 Philosophical Transactions of the Royal Society of London (context) - Kelly - 1991
4 Journal of Mathematical Economics (context) - Mas-Colell, of - 1984
4 The resistance of an electrical network (context) - Cohn - 1950
4 An investment policy to reduce the travel time in a transpor.. (context) - Ridley - 1968
4 Paradoxical behavior of mechanical and electrical networks (context) - Cohen, Horowitz - 1991
3 The designer's perspective to atomic noncooperative networks - Libman, Orda - 1999
3 The economics of tra#c congestion (context) - Arnott, Small - 1994
3 How Braess' paradox solves Newcomb's problem (context) - Irvine - 1993
3 A Course in Game Theory (context) - Osbourne, Rubinstein - 1994
3 A Shapley value representation of potential games (context) - Ui - 2000
3 Transportation Science (context) - Catoni, Pallottino et al. - 1991
3 Equilibria in a model with partial rivalry (context) - Konishi, Le Breton et al. - 1997
3 Congestion models of competition (context) - Milchtaich - 1996
3 A survey on networking games in telecommunications - Altman, Boulogne et al. - 2000
3 Social optimality and cooperation in large congestion games (context) - Milchtaich - 2001
3 The maximum capture problem including relocation (context) - ReVelle, Serra - 1991
3 Anonymous games with binary actions (context) - Blonski - 1999
3 Competitive routing in multicast communications - Boulogne, Altman - 2001
2 Strong equilibrium in congestion games (context) - Holzman, Law-Yone - 1997
2 Potential games: A purely ordinal approach (context) - Kukushkin - 1999
2 Charging Communication Networks (context) - Songhurst - 1999
2 A column generation algorithm for optimal tra#c assignment (context) - Leventhal, Nemhauser et al. - 1973
2 Probability in the Engineering and Informational Sciences (context) - Calvert, ect et al. - 1997
2 Queue spillovers in transportation networks with a route cho.. - Daganzo - 1998
2 A capacity paradox in network design and how to avoid it (context) - Yang, Bell - 1998
2 Leader-follower strategies for multilevel systems (context) - Cruz - 1978
2 An introduction to network models used in transportation pla.. (context) - Florian - 1984
2 The Colebrook-White formula for pipe networks - Keady - 1995
2 Equilibrium programming: The path following approach and dyn.. (context) - Zangwill, Garcia - 1981
2 Braess paradox: Maximum penalty in a minimal critical networ.. (context) - Penchina - 1997
2 erential Games in Economic Models (context) - Bagchi - 1984
2 assignment problem for multiclass-user transportation networ.. (context) - Dafermos - 1972
2 Braess' paradox: Some new insights (context) - Pas, Principio - 1997
2 The counterintuitive in conflict and cooperation (context) - Cohen - 1988
2 Sensitivity analysis for the elastic-demand network equilibr.. (context) - Yang - 1997
2 Counterexamples for comparisons of queues with finite waitin.. (context) - Whitt - 1992
1 International Game Theory Review (context) - Voorneveld, Borm et al. - 1999
1 An algorithm for the tra#c assignment problem (context) - Weintraub, Gonzalez - 1980
1 Secrets of network success (context) - Bean - 1996
1 Introduction and recent advances in network design: Models a.. (context) - Wong - 1984
1 Side constrained tra#c equilibrium in multiuser communicatio.. (context) - Azouzi, Altman - 2001
1 equilibrium model of travel by car and public transit modes (context) - Florian, tra - 1977
1 al games. Games and Economic Behavior (context) - Kukushkin, potenti - 2002
1 Improved results for Stackelberg scheduling strategies (context) - Kumar, Marathe - 2002
1 Empirical evidence for equilibrium paradoxes with implicatio.. (context) - Fisk, Pallottino - 1981
1 assignment model with applications to two-way tra#c (context) - Dafermos, tra - 1971
1 Optimal routing of tra#c flows with length restrictions in n.. (context) - Jahn, Mohring et al. - 1999
1 Survey of leader-follower concepts in hierarchical decisionm.. (context) - Cruz - 1980
1 Congestion models and weighted Bayesian potential games (context) - Facchini, van Megan et al. - 1997
1 Models and algorithms for predicting urban tra#c equilibria (context) - Magnanti - 1984
1 Flow on Transportation Networks (context) - Newell - 1980
1 An algorithm for the tra#c assignment problem (context) - Nguyen - 1974
1 cient method for computing tra#c equilibria in networks with.. (context) - Nguyen, Dupuis - 1984
1 How Braess' paradox solves Newcomb's problem: not (context) - Marino - 1996
1 Computing economic equilibria on a#ne networks with Lemke's .. (context) - Asmuth, Eaves et al. - 1979
1 Properties of dynamic tra#c equilibrium involving bottleneck.. (context) - Arnott, De Palma et al. - 1993
1 The law of peak-hour expressway congestion (context) - Downs - 1962
1 Strings and springs net mechanical surprise (context) - Peterson - 1991
1 Properties of equilibria in competitive routing with several.. (context) - Azouzi, Altman et al. - 2001
1 Uniqueness of user equilibrium in transportation networks wi.. (context) - Konishi - 2001
1 What if they closed 42nd Street and nobody noticed (context) - Kolata - 1990
1 Network topology and the e#ciency of equilibrium (context) - Milchtaich - 2001
1 Cost-deceptive links on ladder networks (context) - Frank - 1983
1 Great Cities and Their Tra#c (context) - Thomson - 1977
1 Braess' paradox in a two-terminal transportation network (context) - Taguchi - 1982
Documents on the same site (http://www.cs.cornell.edu/timr/): More
How Unfair is Optimal Routing? - Roughgarden (2002) (Correct)
Stackelberg Scheduling Strategies - Roughgarden (2001) (Correct)
Designing Networks for Selfish Users is Hard - Roughgarden (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC