Sciweavers

Share
MST
2010

Sensitivity of Wardrop Equilibria

9 years 23 days ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand flow at Wardrop equilibrium, one increases the demand by ε or removes an edge carrying only an ε-fraction of flow. We study how the equilibrium responds to such an ε-change. Our first surprising finding is that, even for linear latency functions, for every ε > 0, there are networks in which an ε-change causes every agent to change its path in order to recover equilibrium. Nevertheless, we can prove that, for general latency functions, the flow increase or decrease on every edge is at most ε. Examining the latency at equilibrium, we concentrate on polynomial latency functions of degree at most p with nonnegative coefficients. We show that, even though the relative increase in the latency of an edge due to an ε-change in the demand can be unbounded, the path latency at equilibrium increases at most ...
Matthias Englert, Thomas Franke, Lars Olbrich
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where MST
Authors Matthias Englert, Thomas Franke, Lars Olbrich
Comments (0)
books