Abstract
We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a desirable property in this situation: all flow-carrying paths have the same length; i.e., these solutions are “fair,” which is in general not true for the optimal flow in networks with nonlinear latency functions. In addition, the maximum latency of the Nash equilibrium, which can be computed efficiently, is within a constant factor of that of an optimal solution. That is, the so-called price of anarchy is bounded. In contrast, we present a family of instances that shows that the price of anarchy is unbounded for instances with multiple sources and a single sink, even in networks with linear latencies. Finally, we show that an s-t-flow that is optimal with respect to the average latency objective is near optimal for the maximum latency objective, and it is close to being fair. Conversely, the average latency of a flow minimizing the maximum latency is also within a constant factor of that of a flow minimizing the average latency.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Anshelevich, E., Desgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), San Diego, CA, pp. 511–520. ACM Press, New York (2003)
Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research 20, 1–66 (1989)
Beccaria, G., Bolelli, A.: Modelling and assessment of dynamic route guidance: The MARGOT project. In: Proceedings of the IEEE Vehicle Navigation & Information Systems Conference, Oslo, Norway, pp. 117–126 (1992)
Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
Braess, D.: Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1968)
Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. MIT, Sloan School of Management, Working Paper No. 4319-03. To appear in Mathematics of Operations Research (2003)
Czumaj, A.: Selfish routing on the Internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, Boca Raton (2004) (to appear)
Czumaj, A., Krysta, P., Vöcking, B.: Selfish traffic allocation for server farms. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, Canada, pp. 287–296. ACM Press, New York (2002)
Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 413–420. SIAM, Philadelphia (2002)
Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the U.S. National Bureau of Standards 73B, 91–118 (1969)
Feldmann, R., Gairing, M., Lücking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 514–526. Springer, Heidelberg (2003)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123–134. Springer, Heidelberg (2002)
Jahn, O., Möhring, R.H., Schulz, A.S., Stier Moses, N.E.: System-optimal routing of traffic flows with user constraints in networks with congestion. MIT, Sloan School of Management, Working Paper No. 4394-02 (2002)
Köhler, E., Langkau, K., Skutella, M.: Time-expanded graphs with flowdependent transit times. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 599–611. Springer, Heidelberg (2002)
Köhler, E., Skutella, M.: Flows over time with load-dependent transit times. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 174–183. SIAM, Philadelphia (2002)
Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory of Computing Systems 36, 683–693 (2003)
Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Greece, pp. 510–519. ACM Press, New York (2001)
Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, Greece, pp. 749–753. ACM Press, New York (2001)
Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Networks. Handbook in Operations Research and Management Science, vol. 4, pp. 141–295. Elsevier Science, Amsterdam (1995)
Roughgarden, T.: How unfair is optimal routing? In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 203–204. SIAM, Philadelphia (2002)
Roughgarden, T.: The price of anarchy is independent of the network topology. Journal of Computer and System Sciences 67, 341–364 (2003)
Roughgarden, T.: The maximum latency of selfish routing. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, LA, pp. 973–974. SIAM, Philadelphia (2004)
Roughgarden, T., Tardos, É.: How bad is selfish routing? Journal of the ACM 49, 236–259 (2002)
Schulz, A.S., Stier Moses, N.E.: On the performance of user equilibria in traffic networks. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore, MD, pp. 86–87. SIAM, Philadelphia (2003)
Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institution of Civil Engineers, vol. 1, Part II, pp. 325–378 (1952)
Weitz, D.: The price of anarchy (2001) (unpublished manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correa, J.R., Schulz, A.S., Stier Moses, N.E. (2004). Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2004. Lecture Notes in Computer Science, vol 3064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25960-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25960-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22113-5
Online ISBN: 978-3-540-25960-2
eBook Packages: Springer Book Archive