Skip to main content
SpringerLink
Log in

Network Load Games

  • Conference paper
Algorithms and Computation (ISAAC 2005)

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

Included in the following conference series:

Abstract

We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims to route some traffic from a source to a destination so that the maximum load she experiences in the links of the network she occupies is minimum given the routing decisions of other users. We present results related to the existence, complexity, and price of anarchy of Pure Nash Equilibria for several network load games. As corollaries, we present interesting new statements related to the complexity of computing equilibria for selfish routing games in networks of restricted parallel links.

This work was partially supported by the European Union under IST FET Integrated Project 015964 AEOLUS.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network flows, Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Björklund, A., Husfeldt, T., Khanna, S.: Approximating longest directed paths and cycles. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 222–233. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 604–612 (2004)

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  6. Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 593–605. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Gairing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 613–622 (2004)

    Google Scholar 

  8. Hochbaum, D.S., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing 17(3), 539–551 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 68–77 (1996)

    Google Scholar 

  10. Kolliopoulos, S., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing 31, 919–946 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Monterer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14, 124–143 (1996)

    Article  MathSciNet  Google Scholar 

  13. Nash, J.F.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)

    Article  MathSciNet  Google Scholar 

  14. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  15. Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM 49(2), 236–259 (2002)

    Article  MathSciNet  Google Scholar 

  16. Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM Journal on Applied Mathematics 38(3), 364–372 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Academic Computer Technology Institute, Department of Computer Engineering and Informatics, University of Patras, 26500, Rio, Greece

    Ioannis Caragiannis, Clemente Galdi & Christos Kaklamanis

  2. Dipartimento di Informatica ed Applicazioni “R.M. Capocelli”, Universitá di Salerno, 84081, Baronissi, SA, Italy

    Clemente Galdi

Authors
  1. Ioannis Caragiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clemente Galdi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christos Kaklamanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon , Hong Kong

    Xiaotie Deng

  2. Department of Computer Science, University of Texas at Dallas, EE/CS Building, 75083, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caragiannis, I., Galdi, C., Kaklamanis, C. (2005). Network Load Games. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_81

Download citation

  • DOI: https://doi.org/10.1007/11602613_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30935-2

  • Online ISBN: 978-3-540-32426-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation