Improving selfish routing for risk-averse players

DOI10.1007/S00224-019-09946-8MaRDI QIDQ2300632zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

price of anarchyrestricted tollsrisk-aversionselfish routinguncertainty

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(2)

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

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)