Stochastic selfish routing

DOI10.1007/978-3-642-24829-0_28MaRDI QIDQ3095284zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

risk aversionstochastic Nash equilibriumnon-additive nonatomic congestion gamestochastic Wardrop equilibrium

Mathematics Subject Classification ID

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)

Recommendations

• Stochastic congestion games with risk-averse players
• Risk-averse selfish routing
• Tradeoffs and average-case equilibria in selfish routing
• The impact of worst-case deviations in non-atomic network routing games
• Tradeoffs and Average-Case Equilibria in Selfish Routing

Cited in

(20)

• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• The impact of worst-case deviations in non-atomic network routing games
• The impact of worst-case deviations in non-atomic network routing games
• Stackelberg Routing in Arbitrary Networks
• The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
• Subjective vs. Objective Reality — The Risk of Running Late
• Equilibrium routing under uncertainty
• Improving selfish routing for risk-averse players
• Stochastic congestion games with risk-averse players
• Reconciling selfish routing with social good
• Selfish routing with incomplete information
• Nonadaptive Selfish Routing with Online Demands
• Risk-averse selfish routing
• Improving selfish routing for risk-averse players
• Anonymous Stochastic Routing
• A mean-risk model for the traffic assignment problem with stochastic travel times
• Pure Nash equilibria in a generalization of congestion games allowing resource failures
• The theory and application of nondeterministic selfish routing model
• Selfish Routing in Capacitated Networks
• Routing selfish unsplittable traffic

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)