Sensitivity of wardrop equilibria: revisited
For single-commodity networks, the increase of the price of anarchy is bounded by a factor of ( 1 + ε ) p from above, when the travel demand is increased by a factor of 1 + ε and the latency functions are polynomials of degree at most p . We show that the same upper bound holds for multi-commodity n...
Gespeichert in:
| Veröffentlicht in: | Optimization letters 2020-04, Vol.14 (3), p.781-796 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | For
single-commodity
networks, the increase of the price of anarchy is bounded by a factor of
(
1
+
ε
)
p
from above, when the travel demand is increased by a factor of
1
+
ε
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. |
|---|---|
| ISSN: | 1862-4472 1862-4480 |
| DOI: | 10.1007/s11590-020-01552-9 |