The Price of Routing Unsplittable Flow
- 1 January 2013
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 42 (1), 160-177
- https://doi.org/10.1137/070702370
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Exact Price of Anarchy for Polynomial Congestion GamesSIAM Journal on Computing, 2011
- Stackelberg Strategies and Collusion in Network Games with Splittable FlowTheory of Computing Systems, 2010
- Nash equilibria in discrete routing games with convex latency functionsJournal of Computer and System Sciences, 2008
- Tight bounds for worst-case equilibriaACM Transactions on Algorithms, 2007
- The price of anarchy for polynomial social costTheoretical Computer Science, 2006
- Tradeoffs in worst-case equilibriaTheoretical Computer Science, 2006
- How much can taxes help selfish routing?Journal of Computer and System Sciences, 2006
- Selfish unsplittable flowsTheoretical Computer Science, 2005
- Competitive routing in networks with polynomial costsIEEE Transactions on Automatic Control, 2002
- Inefficiency of Nash EquilibriaMathematics of Operations Research, 1986