Skip to main content
SpringerLink
Log in

Atomic Routing Games on Maximum Congestion

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4041))

Included in the following conference series:

Abstract

We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is the global maximum congestion over all edges in the network. We show that the price of stability is 1. The price of anarchy, PoA, is determined by topological properties of the network. In particular, PoA = O(ℓ+ logn), where ℓ is the length of the longest path in the player strategy sets, and n is the size of the network. Further, κ– 1 ≤PoA ≤c (κ 2 + log2 n), where κ is the length of the longest cycle in the network, and c is a constant.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. FOCS (2004)

    Google Scholar 

  2. Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near optimal network design with selfish agents. In: Proc. STOC (2003)

    Google Scholar 

  3. Berenbrink, P., Scheideler, C.: Locally efficient on-line strategies for routing packets along fixed paths. In: 10th ACM-SIAM Symposium on Discrete ALgorithms (SODA), pp. 112–121 (1999)

    Google Scholar 

  4. Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. STOC (2005)

    Google Scholar 

  5. Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Computational complexity, fairness, and the price of anarchy of the maximum latency problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 59–73. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Cypher, R., Meyer auf der Heide, F., Scheideler, C., Vöcking, B.: Universal algorithms for store-and-forward and wormhole routing. In: In Proc. of the 28th ACM Symp. on Theory of Computing, pp. 356–365 (1996)

    Google Scholar 

  7. Czumaj, A., Krysta, P., Vöcking, B.: Selfish traffic allocation for server farms. In: Proc. STOC (2002)

    Google Scholar 

  8. Czumaj, A., Vöcking, B.: Tight Bounds for Worst-Case Equilibria. In: Proc. SODA (2002)

    Google Scholar 

  9. 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, p. 123. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. 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 

  11. Garing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proc. STOC (2004)

    Google Scholar 

  12. Garing, M., Lücking, T., Mavronicolas, M., Monien, B.: The price of anarchy for polynomial social cost. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 574–585. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Garing, M., Lücking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 645–657. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. In: Proc. SIROCCO (2002)

    Google Scholar 

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

    Chapter  Google Scholar 

  16. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, San Mateo (1992)

    MATH  Google Scholar 

  17. Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-scheduling in O(congestion+dilation) steps. Combinatorica 14, 167–186 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  18. Leighton, T., Maggs, B., Richa, A.W.: Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19, 375–401 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecomunication Systems 17(4), 385–409 (2001)

    Article  MATH  Google Scholar 

  20. Lücking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 547–558. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  21. Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. STOC (2001)

    Google Scholar 

  22. Monderer, D., Shapely, L.S.: Potential games. Games and Economic Behavior (1996)

    Google Scholar 

  23. Ostrovsky, R., Rabani, Y.: Universal O(congestion+dilation+log1 + ε N) local control packet switching algorithms. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, New York, pp. 644–653 (May 1997)

    Google Scholar 

  24. Papadimitriou, C.H.: Algorithms, games and the internet. In: Proc. STOC, pp. 749–753 (2001)

    Google Scholar 

  25. Rabani, Y., Tardos, É.: Distributed packet switching in arbitrary networks. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 22–24, pp. 366–375 (1996)

    Google Scholar 

  26. Rosenthal, R.W.: A class of games possesing pure-strategy Nash equilibria. International Journal of Game Theory (1973)

    Google Scholar 

  27. Roughgarden, T.: The maximum latency of selfish routing. In: Proc. SODA (2004)

    Google Scholar 

  28. Roughgarden, T.: Selfish routing with atomic players. In: Proc. SODA (2005)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  31. Suri, S., Tóth, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proc. SPAA (2004)

    Google Scholar 

  32. West, D.B.: Introduction to Graph Theory. Prentice-Hall, Upper Saddle River (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, 12180, USA

    Costas Busch & Malik Magdon-Ismail

Authors
  1. Costas Busch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Malik Magdon-Ismail
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Clear Water Bay, Hong Kong University of Science and Technology, Hong Kong, China

    Siu-Wing Cheng

  2. Department of Computer Science, City University of Hong Kong,  

    Chung Keung Poon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Busch, C., Magdon-Ismail, M. (2006). Atomic Routing Games on Maximum Congestion. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_9

Download citation

  • DOI: https://doi.org/10.1007/11775096_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35157-3

  • Online ISBN: 978-3-540-35158-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation