Sciweavers

18 search results - page 1 / 4
» Sensitivity of Wardrop Equilibria
Sort
View
MST
2010
78views more  MST 2010»
13 years 2 months 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 fl...
Matthias Englert, Thomas Franke, Lars Olbrich
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 4 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
13 years 10 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
SIAMCO
2008
40views more  SIAMCO 2008»
13 years 4 months ago
Optimal Transportation with Traffic Congestion and Wardrop Equilibria
G. Carlier, C. Jimenez, F. Santambrogio
TRANSCI
2010
56views more  TRANSCI 2010»
13 years 2 months ago
Wardrop Equilibria with Risk-Averse Users
Fernando Ordóñez, Nicolás E. ...