Name
Abstract | ||
|---|---|---|
For single-commodity networks, the increase of the price of anarchy is bounded by a factor of $$(1+\varepsilon )^p$$ from above, when the travel demand is increased by a factor of $$1+\varepsilon $$ and the latency functions are polynomials of degree at most p. We show that the same upper bound holds for multi-commodity networks and provide a lower bound as well. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11590-020-01552-9 | Optimization Letters |
Keywords | Field | DocType |
Wardrop equilibria, Selfish routing, Price of Anarchy, Sensitivity analysis | Discrete mathematics,Mathematical optimization,Polynomial,Computational intelligence,Latency (engineering),Upper and lower bounds,Price of anarchy,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
14 | 3 | 1862-4472 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mahdi Takalloo | 1 | 0 | 0.34 |
| Changhyun Kwon | 2 | 0 | 0.34 |