# Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology

@article{Benita2020DataDrivenMO,
title={Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology},
author={Francisco Benita and Vittorio Bil{\o} and Barnab{\'e} Monnot and Georgios Piliouras and Cosimo Vinci},
journal={ArXiv},
year={2020},
volume={abs/2009.12871}
}`
• Published 27 September 2020
• Computer Science
• ArXiv
We investigate traffic routing both from the perspective of real world data as well as theory. First, we reveal through data analytics a natural but previously uncaptured regularity of real world routing behavior. Agents only consider, in their strategy sets, paths whose free-flow costs (informally their lengths) are within a small multiplicative $(1+\theta)$ constant of the optimal free-flow cost path connecting their source and destination where $\theta\geq0$. In the case of Singapore…
4 Citations
Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division
• Computer Science
ACM Transactions on Economics and Computation
• 2022
A new metric, the Free-flow Index (FFI) is introduced, which reflects the inefficiency resulting from system congestion and is the first model-free computation of an upper bound to the price of anarchy utilizing only real world measurements of traffic data.
Weighted Stackelberg Algorithms for Road Traffic Optimization
• Computer Science
SIGSPATIAL/GIS
• 2021
A weighted version of the Stackelberg routing problem in which the delay experienced by non-users of the platform is discounted by some parameter β < 1, and natural algorithms for this problem are studied and provable guarantees in the form of constant approximation ratios are provided.
The Impact of Selfish Behavior in Load Balancing Games
• Computer Science
• 2022
This work investigates whether better performance are possible when restricting to load balancing games in which players can only choose among single resources, and proves that, under mild assumptions on the latency functions, improvements on the performance of approximate pure Nash equilibria are possible for load balancinggames with weighted and symmetric players.

## References

SHOWING 1-10 OF 76 REFERENCES
When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic
• Computer Science
Oper. Res.
• 2020
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nonatomic congestion games with multiple origin-destination (O/D) pairs, and shows that it follows a power law whose degree can be computed explicitly when the network's cost functions are polynomials.
The price of anarchy is independent of the network topology
It is shown that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a single-commodity instance on a set of parallel links.
• Computer Science
JACM
• 2002
The degradation in network performance due to unregulated traffic is quantified and it is proved that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency.
Multicommodity Routing Problems-Selfish Behavior and Online Aspects-
Upper bounds on the price of anarchy for polynomial latency functions with nonnegative coefficients and maximum degree d are proved, which improve upon the previous best ones.
The Asymptotic Behavior of the Price of Anarchy
• Economics
WINE
• 2017
It is shown that the price of anarchy may remain bounded away from 1 for all values of the traffic inflow, even in simple three-link networks with a single O/D pair and smooth, convex costs.
Improving Selfish Routing for Risk-Averse Players
• Computer Science
WINE
• 2015
It is proved that computing the best $$\gamma$$-enforceable flow is $$\mathrm {NP}$$-hard for parallel-link networks with affine latencies and two classes of heterogeneous risk-averse players.
Selfish Routing in Capacitated Networks
• Economics
Math. Oper. Res.
• 2004
Positive results on the efficiency of Nash equilibria in traffic networks are offered for networks with capacities and for latency functions that are nonconvex, nondifferentiable, and even discontinuous.