Price of anarchy in transportation networks: Efficiency and optimality control

Physical Review Letters

Volumn 101, Issue 12, 2008, Pages

  Youn, Hyejin ^a   Gastner, Michael T ^b,c   Jeong, Hawoong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b SANTA FE INSTITUTE   (United States)

^c University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COORDINATION REACTIONS; ROADS AND STREETS; TELECOMMUNICATION NETWORKS; TRAFFIC SURVEYS;

COMPLEX NETWORKS; HUMAN SOCIETIES; MAJOR CITIES; NASH EQUILIBRIA; OPTIMAL STRATEGIES; OPTIMALITY; PRICE OF ANARCHY; ROAD NETWORKS; SOCIAL OPTIMUM; TRAFFIC CONDITIONS; TRANSPORTATION NETWORKS; TRAVEL TIMES; TRAVEL-TIME;

MOTOR TRANSPORTATION;

EID: 52649104911     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.101.128701     Document Type: Article

References (29)

1. G. Kossinets and D.J. Watts, Science 311, 88 (2006). SCIEAS 0036-8075 10.1126/science.1116869
2. M. Buchanan, Nature (London) NATUAS 0028-0836 447, 39 (2007). 10.1038/447039a
3. M.T. Gastner and M.E.J. Newman, Phys. Rev. E 74, 016117 (2006). PLEEE8 1063-651X 10.1103/PhysRevE.74.016117
4. L. Qiu, in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (ACM, New York, 2003), p. 151;
5. O. Jahn, Oper. Res. 53, 600 (2005). OPREAI 0030-364X 10.1287/opre.1040. 0197
6. D.M. Levinson, Transp. Rev. 0144-1647 18, 215 (1998). 10.1080/01441649808717014
7. T. Roughgarden, Selfish Routing and the Price of Anarchy (MIT Press, Cambridge, 2005).
8. R. Selten, Games Econ. Behav. GEBEEF 0899-8256 58, 394 (2007); 10.1016/j.geb.2006.03.012
9. A. Rapoport, Games Econ. Behav. GEBEEF 0899-8256 (to be published).
10. R. Singh, in Proceedings of the 7th TRB Conference on the Application of Transportation Planning Methods (Transportation Research Board, Washington, DC, 1999), p. 340.
11. R.F. Roess and W.R. McShane, ITE Journal 57, 27 (1987). ITEJDZ 0162-8178
12. R.K. Ahuja, Network Flows: Theory, Algorithms and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1993).
13. C. Papadimitriou, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2001), p. 749.
14. E.J. Friedman, in Proceedings of the 43rd IEEE Conference on Decision and Control, Nassau, Bahamas (IEEE, New York, 2004), p. 4667;
15. J.R. Correa, Games Econ. Behav. (to be published).
16. Data from Massachusetts Highway Department, http://www.mhd.state.ma.us/.
17. P. Erdos and A. Rényi, Publ. Math. Debrecen 0033-3883 6, 290 (1959);
18. D.J. Watts and S.H. Strogatz, Nature (London) NATUAS 0028-0836 393, 440 (1998); 10.1038/30918
19. A.-L. Barabási and R. Albert, Science 286, 509 (1999). SCIEAS 0036-8075 10.1126/science.286.5439.509
20. J.E. Cohen and P. Horowitz, Nature (London) NATUAS 0028-0836 352, 699 (1991); 10.1038/352699a0
21. C.M. Penchina and L.J. Penchina, Am. J. Phys. 71, 479 (2003). AJPIAS 0002-9505 10.1119/1.1538553
22. R. Cole, J. Comput. Syst. Sci. JCSSBM 0022-0000 72, 444 (2006); 10.1016/j.jcss.2005.09.010
23. P. Maille and N.E. Stier-Moses, Columbia Working Paper DRO-2007-04, 2007.
24. D. Braess, Unternehmensforschung 12, 258 (1968). UNFGAG 0042-0573 10.1007/BF01918335
25. R. Steinberg and W.I. Zangwill, Transp. Sci. 17, 301 (1983); TRSCBJ 0041-1655
26. G. Valiant and T. Roughgarden, in Proceedings of the 7th ACM Conference on Electronic Commerce (ACM, New York, 2006), p. 296.
27. W. Knödel, Graphentheoretische Methoden und ihre Anwendungen (Springer, Heidelberg, 1969);
28. C. Fisk and S. Pallottino, Transp. Res., Part A. TRPPEC 0965-8564 15, 245 (1981); 10.1016/0191-2607(81)90005-4
29. New York Times, 25 December 1990, p. 38.