Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division
-
Published:2022-03-31
Issue:1
Volume:10
Page:1-26
-
ISSN:2167-8375
-
Container-title:ACM Transactions on Economics and Computation
-
language:en
-
Short-container-title:ACM Trans. Econ. Comput.
Author:
Monnot Barnabé1ORCID,
Benita Francisco2ORCID,
Piliouras Georgios2ORCID
Affiliation:
1. Ethereum Foundation, Berlin, Germany
2. Engineering and Systems Design, SUTD, Singapore
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:
-
Does the traffic stabilize?
-
Is the system behavior consistent with latency-minimizing agents?
-
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
Free-flow Index (FFI)
, which reflects the inefficiency resulting from system congestion. Along the way, we provide the first model-free computation of an upper bound to the price of anarchy utilizing only real world measurements of traffic data.
Funder
Ministry of Education, Singapore
MOE AcRF Tier 2
NRF
Singapore National Research Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Marketing,Economics and Econometrics,Statistics and Probability,Computer Science (miscellaneous)
Reference53 articles.
1. Concurrent imitation dynamics in congestion games
2. Stochastic Congestion Games with Risk-Averse Players
3. Game Theory and Econometrics: A Survey of Some Recent Research
4. Hillel Bar-Gera. 2011. Transportation network test problems. Retrieved 13 Feb. 2022 from http://www.bgu.ac.il/bargera/tntp/.
5. Short-distance commuters in the smart city;Benita Francisco;arXiv:1902.08028,2019
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献