The Price of Routing Unsplittable Flow
By Baruch Awerbuch, Yossi Azar, Amir Epstein. Symposium on the Theory of Computing, 2005
404 citations recorded by the source corpus.
Subfields: Economics and Econometrics, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/8192c8a53a11b9602409f23451739bf91131b777
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Economics and Econometrics
- Tim Roughgarden
- É. Tardos
- George Christodoulou
- Elias Koutsoupias
- Anirban Dasgupta
- Elliot Anshelevich
- Jon M. Kleinberg
- Tom Wexler
In Management Science and Operations Research
- É. Tardos
- Tim Roughgarden
- George Christodoulou
- Elias Koutsoupias
- Jon M. Kleinberg
- Anirban Dasgupta
- Elliot Anshelevich
- Tom Wexler
Citations in the corpus
- Selfish routing and the price of anarchy (2005, background): “The price of anarchy of selfish routing has also been studied with objective functions other than (3) [21, 46, 64, 68, 86]; with edge capacities and other types of “side constraints” [22, 34, 39]; when the traffic rates can vary with the network congestion [14, 19]; when network users can have nonne”
- The price of stability for network design with fair cost allocation (2004, background): “Subsequent to our work, further results on the price of anarchy and stability in atomic games with delays were obtained in [4, 7, 11, 10, 40].”
- The price of anarchy of finite congestion games (2005, result): “Paper [1], which appears in these proceedings, studies a similar problem with this work.”