Stochastic selfish routing

Authors:
Evdokia Nikolova;Nicolas Stier-Moses
Affiliations:
Texas A&M University;Columbia University
Venue:
ACM SIGecom Exchanges
Year:
2012

Citing 5
Cited 0

How bad is selfish routing?

Journal of the ACM (JACM)
The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002
Selfish Routing in Capacitated Networks

Mathematics of Operations Research
Wardrop Equilibria with Risk-Averse Users

Transportation Science
Stochastic selfish routing

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model for routing games in which edge delay functions are uncertain and users are risk-averse. We investigate how the uncertainty and risk-aversion transform the classical theory on routing games, including equilibria existence, characterization and price of anarchy.