Skip to main content
SpringerLink
Log in

Further Results on Capacitated Network Design Games

  • Conference paper
  • First Online:
Algorithmic Game Theory (SAGT 2015)

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

Included in the following conference series:

Abstract

In a capacitated network design game, each of n players selects a path from her source to her sink. The cost of each edge is shared equally among the players using the edge. Every edge has a finite capacity that limits the number of players using the edge. We study the price of stability for such games with respect to the max-cost objective, i.e., the maximum cost paid by any player. We show that the price of stability is O(n) for symmetric games, and this bound is tight. Furthermore, we show that the price of stability for asymmetric games can be \(\varOmega (n \log n)\), matching the previously known upper bound. We also prove that the convergence time of best response dynamics cannot be bounded by any function of n.

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

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)

    MATH  Google Scholar 

  2. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602–1623 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Disser, Y., Feldmann, A.E., Klimm, M., Mihalák, M.: Improving the \(H_k\)-bound on the price of stability in undirected shapley network design games. Theoret. Comput. Sci. 562, 557–564 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Feldman, M., Ron, T.: Capacitated network design games. In: Serna, M. (ed.) SAGT 2012. LNCS, vol. 7615, pp. 132–143. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

  6. Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124–143 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Book  MATH  Google Scholar 

  8. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schulz, A.S., Moses, N.E.S.: On the performance of user equilibria in traffic networks. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 86–87 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leicester, Leicester, UK

    Thomas Erlebach & Matthew Radoja

Authors
  1. Thomas Erlebach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthew Radoja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthew Radoja .

Editor information

Editors and Affiliations

  1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Martin Hoefer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Erlebach, T., Radoja, M. (2015). Further Results on Capacitated Network Design Games. In: Hoefer, M. (eds) Algorithmic Game Theory. SAGT 2015. Lecture Notes in Computer Science(), vol 9347. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48433-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48433-3_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48432-6

  • Online ISBN: 978-3-662-48433-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation