Skip to main content
SpringerLink
Log in

Best Response Algorithms for Selfish Routing

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 56 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Awerbuch B, Azar Y, Epstein A (2005) The price of routing unsplittable flows. In: Proceedings of the ACM symposium on theory of computing (STOC) 2005. ACM, New York, pp 57–66

    Google Scholar 

  2. Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10:303–318

    Article  MathSciNet  MATH  Google Scholar 

  3. Fotakis D, Kontogiannis S, Spirakis P (2006) Symmetry in network congestion games: pure equilibria and anarchy cost. In: Proceedings of the 3rd workshop of approximate and on-line algorithms (WAOA 2005). Lecture notes in computer science (LNCS), vol 3879. Springer, Berlin/Heidelberg, pp 161–175

    Google Scholar 

  4. Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. J Theor Comput Sci 348:226–239

    Article  MathSciNet  MATH  Google Scholar 

  5. Libman L, Orda A (2001) Atomic resource sharing in noncooperative networks. Telecommun Syst 17(4):385–409

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Informatics, Research and Academic Computer Technology Institute, Patras University, Patras, Greece

    Paul (Pavlos) Spirakis

  2. Computer Science, University of Liverpool, Liverpool, UK

    Paul (Pavlos) Spirakis

  3. Computer Technology Institute (CTI), Patras, Greece

    Paul (Pavlos) Spirakis

Authors
  1. Paul (Pavlos) Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Spirakis, P.(. (2016). Best Response Algorithms for Selfish Routing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_46

Download citation

Publish with us

Policies and ethics

Search

Navigation