pith. sign in

arxiv: 1708.04081 · v1 · pith:DCN7WEDOnew · submitted 2017-08-14 · 💻 cs.GT

Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)

classification 💻 cs.GT
keywords routingtrafficbehaviorefficiencyeverydaygamessystemwell
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.