Sensitivity of Wardrop equilibria
From MaRDI portal
Publication:987396
Recommendations
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
- Über ein Paradoxon aus der Verkehrsplanung
- Worst-case equilibria
Cited in
(12)- Sensitivity and robustness of mechanism balancing.
- Price of anarchy for highly congested routing games in parallel networks
- Escaping Braess's paradox through approximate Caratheodory's theorem
- Sensitivity of wardrop equilibria: revisited
- On the price of anarchy of highly congested nonatomic network games
- Robust Wardrop Equilibrium
- Computing all Wardrop equilibria parametrized by the flow demand
- Sensitivity of Wardrop Equilibria
- Stackelberg pricing games with congestion effects
- The price of anarchy in routing games as a function of the demand
- Edge ranking in a transport graph of Petrozavodsk basing on equilibrium flows
- Sensitivity analysis for a Cournot equilibrium
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 Q987396)