Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)
arXiv:1708.04081
Abstract
Routing games are amongst the most well studied domains of game theory. How relevant are these pen-and-paper calculations to understanding the reality of everyday traffic routing? We focus on a semantically rich dataset that captures detailed information about the daily behavior of thousands of Singaporean commuters and examine the following basic questions: (i) Does the traffic equilibrate? (ii) Is the system behavior consistent with latency minimizing agents? (iii) Is the resulting system efficient? In order to capture the efficiency of the traffic network in a way that agrees with our everyday intuition we introduce a new metric, the stress of catastrophe, which reflects the combined inefficiencies of both tragedy of the commons as well as price of anarchy effects.
arXiv comment22 pages, 9 figures, this article supersedes arXiv:1703.01599v2
References in corpus (5)
- Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics
- Data-driven Estimation of Origin-Destination Demand and User Cost Functions for the Optimization of Transportation Networks
- Econometrics for Learning Agents
- Power-saving transportation mode identification for large-scale applications
- Learning and Trust in Auction Markets