Sensitivity of Wardrop Equilibria

DOI10.1007/978-3-540-79309-0_15MaRDI QIDQ5459981zbMATH OpenOpenAlexFDO

Authors Matthias Englert, Thomas Franke, Lars Olbrich

Publication date 2 May 2008

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/47592/1/fulltext21.pdf

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Games involving graphs (91A43)

Recommendations

• Sensitivity of Wardrop equilibria
• Sensitivity of wardrop equilibria: revisited
• Computing all Wardrop equilibria parametrized by the flow demand
• Sensitivity analysis for the asymmetric network equilibrium problem
• Sensitivity Analysis for Equilibrium Network Flow

Cites work

• How bad is selfish routing?
• scientific article; zbMATH DE number 2119661 (Why is no real title available?)
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Sensitivity analysis for the asymmetric network equilibrium problem
• The price of anarchy is independent of the network topology
• Traffic assignment problem for a general network
• Worst-case equilibria
• Über ein Paradoxon aus der Verkehrsplanung

Cited in

(6)

• Sensitivity and robustness of mechanism balancing.
• The impact of worst-case deviations in non-atomic network routing games
• Sensitivity of wardrop equilibria: revisited
• Robust Wardrop Equilibrium
• Sensitivity analysis for a Cournot equilibrium
• Sensitivity of Wardrop equilibria

This page was built for publication: Sensitivity of Wardrop Equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459981)