Skip to main content
SpringerLink
Log in
Book cover

Algorithmics of Large and Complex Networks pp 292–318Cite as

Models of Non-atomic Congestion Games – From Unicast to Multicast Routing

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5515))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roughgarden, T., Tardos, É.: Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47(2), 389–403 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pigou, A.C.: The economics of welfare. Macmillan, London (1920)

    Google Scholar 

  3. Wardrop, J.G.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers, Part II 1, 325–362 (1952)

    Article  Google Scholar 

  4. Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transportation Research Part B: Methodological 13(4), 295–304 (1979)

    Article  MathSciNet  Google Scholar 

  5. Nagurney, A.: Network Economics: A Variational Inequality Approach. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  6. Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Applications. Academic Press, New York (1980)

    MATH  Google Scholar 

  7. Roughgarden, T.: Selfish routing. Ph.D thesis, Cornell University, Ithaca, NY, USA (2002)

    Google Scholar 

  8. Braess, D.: Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1968)

    MathSciNet  MATH  Google Scholar 

  9. Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transportation Science 39, 446–450 (2005); Translation from the original German

    Article  Google Scholar 

  10. Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Mathematics of Operations Research 29(4), 961–976 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  12. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics and Transportation. Yale University Press, Haven (1956)

    Google Scholar 

  13. 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)

    MathSciNet  MATH  Google Scholar 

  14. 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)

    Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. 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)

    Book  MATH  Google Scholar 

  17. 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)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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)

    Google Scholar 

  19. 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)

    Article  Google Scholar 

  20. 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)

    Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Christian-Albrechts-Universität Kiel, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Lasse Kliemann & Anand Srivastav

Authors
  1. Lasse Kliemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anand Srivastav
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer & Information Science, University of Konstanz, 78457, Konstanz, Germany

    Jürgen Lerner

  2. Institute of Theoretical Informatics, Technical University of Karlsruhe, 76128, Karlsruhe, Germany

    Dorothea Wagner

  3. Department of Biological Physics, Eötvös Lorand University, Pazmany P. Stny 1A, 1117, Budapest, Hungary

    Katharina A. Zweig

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation