Abstract
We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results and challenges for an extended model, which we call consumption-relevance congestion games. We introduce the consumption-relevance congestion game first and show that all other models are special cases of it. Our focus is on the price of anarchy, computation of equilibria, and experimental studies. Further interesting aspects are summarized at the end of this article.
Keywords
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
Roughgarden, T., Tardos, É.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47(2), 389–403 (2004)
Pigou, A.C.: The economics of welfare. Macmillan, London (1920)
Wardrop, J.G.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, Part II 1, 325–362 (1952)
Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transportation Research Part B: Methodological 13(4), 295–304 (1979)
Nagurney, A.: Network Economics: A Variational Inequality Approach. Springer, Heidelberg (1999)
Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Applications. Academic Press, New York (1980)
Roughgarden, T.: Selfish routing. Ph.D thesis, Cornell University, Ithaca, NY, USA (2002)
Braess, D.: Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1968)
Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transportation Science 39, 446–450 (2005); Translation from the original German
Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research 29(4), 961–976 (2004)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics and Transportation. Yale University Press, Haven (1956)
Dafermos, S.C., Sparrow, F.T.: The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards 73B(2), 91–118 (1969)
Kliemann, L.: The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games. Technical Report 0814, Institut für Informatik, Christian-Albrechts-Universität Kiel (2008)
Baltz, A., Esquivel, S., Kliemann, L., Srivastav, A.: The price of anarchy in selfish multicast routing. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, pp. 5–18. Springer, Heidelberg (2006)
Conn, A.R., Gould, N.I.M., Toint, P.L.: Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A). Springer, New York (1992)
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical Programming 106(1), 25–57 (2006)
Kliemann, L.: Experimental studies of the price of anarchy in consumption-relevance congestion games. Technical report, Institut für Informatik, Christian-Albrechts-Universität Kiel (2008) (in preparation)
Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking 5(1), 161–173 (1997)
Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS, pp. 277–285. IEEE Computer Society, Los Alamitos (2004)
Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Kleinberg, J.M. (ed.) STOC, pp. 653–662. ACM, New York (2006)
Fischer, S., Olbrich, L., Vöcking, B.: Approximating Wardrop equilibria with finitely many agents. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 238–252. Springer, Heidelberg (2007)
Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 169–178. SIAM, Philadelphia (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kliemann, L., Srivastav, A. (2009). Models of Non-atomic Congestion Games – From Unicast to Multicast Routing. In: Lerner, J., Wagner, D., Zweig, K.A. (eds) Algorithmics of Large and Complex Networks. Lecture Notes in Computer Science, vol 5515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02094-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-02094-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02093-3
Online ISBN: 978-3-642-02094-0
eBook Packages: Computer ScienceComputer Science (R0)