Selfish routing in capacitated networks

Mathematics of Operations Research

Volumn 29, Issue 4, 2004, Pages 961-976

  Correa, José R ^a   Schulz, Andreas S ^b   Stier Moses, Nicolás E ^c  

^a UNIVERSITY OF CHILE   (Chile)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c The Sanford C Bernstein Co Center for Leadership and Ethics   (United States)

Author keywords

Multicommodity flow; Nash equilibrium; Performance guarantee; Price of anarchy; Selfish routing; System optimum; Traffic assignment

Indexed keywords

GAME THEORY; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; ROUTERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

MULTICOMMODITY FLOW; NASH EQUILIBRIUM; NONCOOPERATIVE GAME; PRICE OF ANARCHY; SELFISH ROUTING; SYSTEM OPTIMUM; TRAFFIC ASSIGNMENT;

SYSTEMS ANALYSIS;

EID: 11244255068     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.1040.0098     Document Type: Article

References (48)

1. Beckmann, M. J., C. B. McGuire, C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
2. Bernstein, D., T. E. Smith. 1994. Equilibria for networks with lower semicontinuous costs: With an application to congestion pricing. Transportation Sci. 28 221-235.
3. Bertsekas, D. P. 1999. Nonlinear Programming, 2nd ed. Athena Scientific, Belmont, MA.
4. Boyce, D. E. 1989. Contributions of transportation network modelling to the development of a real-time route guidance system. D. Batten, R. Thord, eds. Transportation for the Future. Springer, Berlin, Germany, 161-177.
5. Boyce, D. E., B. N. Janson, R. W. Eash. 1981. The effect on equilibrium trip assignment of different link congestion functions. Transportation Res. 15A 223-232.
6. Braess, D. 1968. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 258-268.
7. Branston, D. 1976. Link capacity functions: A review. Transportation Res. 10 223-236.
8. Bureau of Public Roads. 1964. Traffic Assignment Manual. U.S. Department of Commerce, Urban Planning Division, Washington, DC.
9. Charnes, A., W. W. Cooper. 1961. Multicopy traffic network models. R. Herman, ed. Theory of Traffic Flow. Elsevier, Amsterdam, The Netherlands, 85-96.
10. Chau, C. K., K. M. Sim. 2003. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Oper. Res. Lett. 31 327-334.
11. Dafermos, S. 1980. Traffic equilibrium and variational inequalities. Transportation Sci. 14 42-54.
12. Dafermos, S. C., F. T. Sparrow. 1969. The traffic assignment problem for a general network. J. Res. National Bureau of Standards 73B 91-118.
13. Daganzo, C. F. 1977a. On the traffic assignment problem with flow dependent costs - I. Transportation Res. 11 433-437.
14. Daganzo, C. F. 1977b. On the traffic assignment problem with flow dependent costs - II. Transportation Res. 11 439-441.
15. de Palma, A., Y. Nesterov. 1998. Optimization formulations and static equilibrium in congested transportation networks. CORE discussion paper 9861, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
16. Downs, A. 1962. The law of peak-hour expressway congestion. Traffic Quart. 16 393-409.
17. Dupuit, J. 1849. On tolls and transport charges. Annales des Ponts et Chaussées. Reprinted in Internat. Econom. Papers 11 1962) 7-31.
18. Florian, M. 1999. Untangling traffic congestion: Application of network equilibrium models in transportation planning. OR/MS Today 26 2) 52-57.
19. Florian, M., D. Heam. 1995. Network equilibrium models and algorithms. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science Vol. 8, Chap. 6. Elsevier, Amsterdam, The Netherlands, 485-550.
20. Gartner, N. H., S. B. Gershwin, J. D. C. Little, P. Ross. 1980. Pilot study of computer-based urban traffic management. Transportation Res. 14B 203-217.
21. Hearn, D. W. 1980. Bounding flows in traffic assignment models. Technical report 80-4, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
22. Hearn, D. W., M. V. Ramana. 1998. Solving congestion toll pricing models. P. Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modeling. Kluwer Academic Publishers, Boston, MA, 109-124.
23. Hearn, D. W., J. Ribera. 1980. Bounded flow equilibrium problems by penalty methods. Proc. IEEE Internat. Conf. Circuits Comput., Vol. 1, IEEE, New York, 162-166.
24. Hearn, D. W., J. Ribera. 1981. Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems. Transportation Res. 15B 437-442.
25. Henry, J. J., C. Charbonnier, J. L. Farges. 1991. Route guidance, individual. M. Papageorgiou, ed. Concise Encyclopedia of Traffic and Transportation Systems. Pergamon Press, Oxford, U.K., 417-422.
26. Jorgensen, N. O. 1963. Some aspects of the urban traffic assignment problem. Master's thesis, Institute of Transportation and Traffic Engineering, University of California at Berkeley, Berkeley, CA.
27. Knight, F. H. 1924. Some fallacies in the interpretation of social cost. Quart. J. Econom. 38 582-606.
28. Kohl, J. G. 1841. Der Verkehr und die Ansiedelungen der Menschen in ihrer Abhängigkeit von der Gestaltung der Erdoberfläche. Arnold, Dresden, Germany.
29. Larsson, T., M. Patriksson. 1994. Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models. Le Matematiche 49 249-280.
30. Larsson, T., M. Patriksson. 1995. An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems. Transportation Res. 29B 433-455.
31. Larsson, T., M. Patriksson. 1999. Side constrained traffic equilibrium models - Analysis, computation and applications. Transportation Res. 33B 233-264.
32. Magnanti, T. L. 1984. Models and algorithms for predicting urban traffic equilibria. M. Florian, ed. Transportation Planning Models. North-Holland, Amsterdam, The Netherlands, 153-185.
33. Marcotte, P., S. Nguyen. A. Schoeb. 2004. A strategic flow model of traffic assignment in static capacitated networks. Oper. Res. 52 191-212.
34. Merchant, D. K., G. L. Nemhauser. 1978. A model and an algorithm for the dynamic traffic assignment problems. Transportation Sci. 12 183-199.
35. Papadimitriou, C. H. 2001. Algorithms, games, and the Internet. Proc. 33rd Annual ACM Sympos. Theory Comput., Heraklion, Greece. 749-753.
36. Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands.
37. Perakis, G. 2004. The price of anarchy when costs are non-separable and asymmetric. D. Bienstock, G. Nemhauser, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 3064. Springer, Berlin, Germany, 46-58.
38. Pigou. A. C. 1920. The Economics of Welfare. Macmillan, London. U.K.
39. Prager, W. 1954. Problems of traffic and transportation. Proc. Sympos. Oper. Res. Bus. Indust. Midwest Research Institute, Kansas City, MO, 105-113.
40. Roughgarden, T. 2003. The price of anarchy is independent of the network topology. J. Comput. System Sci. 67 341-364.
41. Roughgarden, T., É. Tardos. 2002. How bad is selfish routing? J. ACM 49 236-259.
42. Roughgarden, T., É. Tardos. 2004. Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econom. Behavior. 47 389-403.
43. Sheffi, Y. 1985. Urban Transportation Networks. Prentice-Hall, Englewood Cliffs, NJ.
44. Smith, M. J. 1979. The existence, uniqueness and stability of traffic equilibria. Transportation Res. 13B 295-304.
45. Stier-Moses, N. E. 2004. Selfish versus coordinated routing in network games. Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
46. Steenbrink, P. A. 1974. Optimization of Transport Networks. John Wiley and Sons, London, U.K.
47. Wardrop, J. G. 1952. Some theoretical aspects of road traffic research. Proc. Ins. Civil Engineers 1(Part II) 325-378.
48. Yang, H., S. Yagar. 1994. Traffic assignment and traffic control in general freeway-arterial corridor systems. Transportation Res. 28B 463-486.