Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Best Response Algorithms for Selfish Routing

  • Paul (Pavlos) Spirakis
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_46

Years and Authors of Summarized Original Work

  • 2005; Fotakis, Kontogiannis, Spirakis

Problem Definition

A setting is assumed in which n selfish users compete for routing their loads in a network. The network is an \( { s - t } \)

Keywords

Atomic selfish flows 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 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–66Google Scholar
  2. 2.
    Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10:303–318MathSciNetzbMATHCrossRefGoogle Scholar
  3. 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–175Google Scholar
  4. 4.
    Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. J Theor Comput Sci 348:226–239MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Libman L, Orda A (2001) Atomic resource sharing in noncooperative networks. Telecommun Syst 17(4):385–409zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Paul (Pavlos) Spirakis
    • 1
    • 2
    • 3
  1. 1.Computer Engineering and Informatics, Research and Academic Computer Technology InstitutePatras UniversityPatrasGreece
  2. 2.Computer ScienceUniversity of LiverpoolLiverpoolUK
  3. 3.Computer Technology Institute (CTI)PatrasGreece