Improving selfish routing for risk-averse players

DOI10.1007/S00224-019-09946-8zbMATH Open1443.91032OpenAlexW2972341206MaRDI QIDQ2300632FDOQ2300632

Authors: Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas 

Publication date: 27 February 2020

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-019-09946-8

Recommendations

• Improving selfish routing for risk-averse players
• Risk-averse selfish routing
• Stochastic selfish routing
• The impact of worst-case deviations in non-atomic network routing games

zbMATH Keywords

uncertaintyprice of anarchyrisk-aversionselfish routingrestricted tolls

Mathematics Subject Classification ID

Games involving graphs (91A43) Potential and congestion games (91A14)

Cites Work

• Selfish Routing in Capacitated Networks
• Prospect Theory: An Analysis of Decision under Risk
• When the players are not expectation maximizers
• The Recognition of Series Parallel Digraphs
• Stackelberg Scheduling Strategies
• Efficiency of restricted tolls in non-atomic network routing games
• Cost-balancing tolls for atomic network congestion games
• Stochastic selfish routing
• Stochastic congestion games with risk-averse players
• Linear tolls suffice: new bounds and algorithms for tolls in single source networks
• Improving selfish routing for risk-averse players
• The impact of worst-case deviations in non-atomic network routing games
• Computing optimal tolls with arc restrictions and heterogeneous players

Cited In (2)

• Risk-averse selfish routing
• Improving selfish routing for risk-averse players

This page was built for publication: Improving selfish routing for risk-averse players

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