Stochastic selfish routing
DOI10.1007/978-3-642-24829-0_28zbMATH Open1233.90087OpenAlexW175035824MaRDI QIDQ3095284FDOQ3095284
Authors: E. Nikolova, N. E. Stier-Moses 
Publication date: 28 October 2011
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24829-0_28
Recommendations
risk aversionstochastic Nash equilibriumnon-additive nonatomic congestion gamestochastic Wardrop equilibrium
Applications of game theory (91A80) Stochastic network models in operations research (90B15) Stochastic games, stochastic differential games (91A15) Stochastic scheduling theory in operations research (90B36)
Cited In (20)
- The impact of worst-case deviations in non-atomic network routing games
- The impact of worst-case deviations in non-atomic network routing games
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Stackelberg Routing in Arbitrary Networks
- Risk-averse selfish routing
- Routing selfish unsplittable traffic
- Anonymous Stochastic Routing
- Nonadaptive Selfish Routing with Online Demands
- Improving selfish routing for risk-averse players
- Selfish routing with incomplete information
- Improving selfish routing for risk-averse players
- The theory and application of nondeterministic selfish routing model
- Subjective vs. Objective Reality — The Risk of Running Late
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- Equilibrium routing under uncertainty
- Stochastic congestion games with risk-averse players
- Pure Nash equilibria in a generalization of congestion games allowing resource failures
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
- Selfish Routing in Capacitated Networks
- Reconciling selfish routing with social good
This page was built for publication: Stochastic selfish routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095284)
