Sensitivity of Wardrop Equilibria: Revisited
For single-commodity networks, the increase of the price of anarchy is bounded by a factor of $(1+\epsilon)^p$ from above, when the travel demand is increased by a factor of $1+\epsilon$ and the latency functions are polynomials of degree at most $p$. We show that the same upper bound holds for mult...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| 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+\epsilon)^p$ from above, when the travel demand is
increased by a factor of $1+\epsilon$ 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. |
|---|---|
| DOI: | 10.48550/arxiv.2002.05510 |