Fast, fair, and efficient flows in networks

Operations Research

Volumn 55, Issue 2, 2007, Pages 215-225

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

^a UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Uris Hall ^*  (United States)

Author keywords

Games group decisions: noncooperative; Network; Networks graphs: multicommodity; Nonatomic; Theory; Transportation: models

Indexed keywords

EQUILIBRIUM FLOW SHARE; GROUP DECISIONS; MULTICOMMODITY;

GRAPH THEORY; LINEAR SYSTEMS; OPTIMAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

OPERATIONS RESEARCH;

EID: 34247534278     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1070.0383     Document Type: Article

References (38)

1. Aronson, J. E. 1989. A survey of dynamic network flows. Ann. Oper. Res. 20 1-66.
2. Beccaria, G., A. Bolelli. 1992. Modelling and assessment of dynamic route guidance: The MARGOT project. L. Olaussen, E. Helli, eds. Proc. 3rd. IEEE Vehicle Navigation and Inform. Systems Conf., Oslo, Norway, 117-126.
3. Beckmann, M. J., C. B. McGuire, C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
4. Braess, D. 1968. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12 258-268.
5. An English translation appeared in Transportation Sci. 39 446-450, 2005.
6. Chakrabarty, D., A. Mehta, V. Nagarajan, V. Vazirani. 2005. Fairness and optimality in congestion games. J. Riedl, M. J. Kearns, M. K. Reiter, eds. Proc. 6th ACM Conf. Electronic Commerce (EC), Vancouver, BC, Canada, 52-57.
7. Correa, J. R., A. S. Schulz, N. E. Stier-Moses. 2004a. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. D. Bienstock, G. Nemhauser, eds. Proc. 10th Internat. Integer Programming and. Combin. Optim. Conf.(IPCO), New York. Lecture Notes in Comput. Sci., Vol. 3064. Springer, Heidelberg, Germany, 59-73.
8. Correa, J. R., A. S. Schulz, N. E. Stier-Moses. 2004b. Selfish routing in capacitated networks. Math. Oper. Res. 29(4) 961-976.
9. Correa, J. R., A. S. Schulz, N. E. Stier-Moses. 2005. On the inefficiency of equilibria in congestion games. M. Jünger, V. Kaibel, eds. Proc. 11th Internat. Integer Programming and Combin. Optim. Conf.(IPCO), Berlin, Germany. Lecture Notes in Computer Science, Vol. 3509. Springer, Heidelberg, Germany, 167-181.
10. Czumaj, A. 2004. Selfish routing on the Internet. J. Leung, ed. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapman & Hall/CRC Computer and Information Science Series, Vol. 1, chapter 42. CRC Press, Boca Raton, FL.
11. Czumaj, A., B. Vöcking. 2002. Tight bounds for worst-case equilibria. Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), San Francisco, CA. SIAM, Philadelphia, PA, 413-420.
12. Czumaj, A., P. Krysta, B. Vöcking. 2002. Selfish traffic allocation for server farms. Proc. 34th Annual ACM Sympos. Theory of Comput. (STOC), Montreal, Canada. ACM Press, New York, 287-296.
13. Dafermos, S. C., F. T. Sparrow. 1969. The traffic assignment problem for a general network. J. Res. U.S. National Bureau of Standards 73B 91-118.
14. Fleischer, L., M. Skutella. 2007. Quickest flows over time. SIAM J. Comput. 36(6) 1600-1630.
15. Ford, L. R., D. R. Fulkerson. 1958. Constructing maximal dynamic flows from static flows. Oper. Res. 6 419-433.
16. Grötschel, M., L. Lovász, A. Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization. Springer, Berlin, Germany.
17. Hoppe, B., É. Tardos. 1994. Polynomial time algorithms for some evacuation problems. Proc. 5th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), Arlington, VA. SIAM, Philadelphia, PA, 433-441.
18. Jahn, O., R. H. Möhring, A. S. Schulz, N. E. Stier-Moses. 2005. System-optimal routing of traffic flows with user constraints in networks with congestion. Oper. Res. 53(4) 600-616.
19. Jarvis, J. J., H. D. Ratliff. 1982. Some equivalent objectives for dynamic network flow problems. Management Sci. 28(1) 106-109.
20. Köhler, E., M. Skutella. 2005. Flows overtime with load-dependent transit times. SIAM J. Optim. 15(4) 1185-1202.
21. Koutsoupias, E., C. H. Papadimitriou. 1999. Worst-case equilibria. C. Meinel, S. Tison, eds. Proc. 16th Annual Sympos. Theoret. Aspects Comput. Sci. (STACS), Trier, Germany. Lecture Notes in Computer Science, Vol. 1563. Springer, Heidelberg, Germany, 404-413.
22. Koutsoupias, E., M. Mavronicolas, P. Spirakis. 2003. Approximate equilibria and ball fusion. Theory Comput. Systems 36(6) 683-693.
23. Lin, H., T. Roughgarden, É. Tardos, A. Walkover. 2005. Braess's paradox, Fibonacci numbers, and exponential inapproximability. L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, M. Yung, eds. Automata, Languages and Programming: Proc. 32nd Internat. Colloquium (ICALP), Lisboa, Portugal. Lecture Notes in Computer Science, Vol. 3580. Springer, Heidelberg, Germany, 497-512.
24. Mavronicolas, M., P. Spirakis. 2001. The price of selfish routing. Proc. 33rd Annual ACM Sympos. Theory Comput. (STOC), Hersonissos, Greece. ACM Press, New York, 510-519.
25. Papadimitriou, C. H. 2001. Algorithms, games, and the Internet. Proc. 33rd Annual ACM Sympos. Theory Comput. (STOC), Hersonissos, Greece. ACM Press, New York, 749-753.
26. Potra, F., Y. Ye. 1993. A quadratically convergent polynomial algorithm for solving entropy optimization problems. SIAM J. Optim. 3(4) 843-860.
27. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Networks. Handbooks in Operations Research and Management Science, Vol. 4. Elsevier Science, Amsterdam, The Netherlands, 141-295.
28. Qiu, L., Y. R. Yang, Y. Zhang, S. Shenker. 2006. On selfish routing in Internet-like environments. IEEE/ACM Trans. Netw. 14(4) 725-738.
29. Roughgarden, T. 2002. How unfair is optimal routing? Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), San Francisco, CA. SIAM, Philadelphia, PA, 203-204.
30. Roughgarden, T. 2003a. Personal communication.
31. Roughgarden, T. 2003b. The price of anarchy is independent of the network topology. J. Comput. System Sci. 67 341-364.
32. Roughgarden, T. 2004. The maximum latency of selfish routing. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), New Orleans, LA. SIAM, Philadelphia, PA, 973-974.
33. Roughgarden, T., É. Tardos. 2002. How bad is selfish routing? J. ACM 49 236-259.
34. Schrijver, A. 1998. Theory of Linear and Integer Programming. J. Wiley & Sons, New York.
35. Schulz, A. S., N. E. Stier-Moses. 2003. On the performance of user equilibria in traffic networks. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA), Baltimore, MD. SIAM, Philadelphia, PA, 86-87.
36. Vavasis, S. A. 1991. Nonlinear Optimization: Complexity Issues. Oxford University Press, New York.
37. Wardrop, J. G. 1952. Some theoretical aspects of road traffic research. Proc. Institution Civil Engineers, Part II, Vol. 1. 325-378.
38. Weitz, D. 2001. The price of anarchy. Unpublished manuscript, University of California, Berkeley, CA.