{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:38:11Z","timestamp":1768340291751,"version":"3.49.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"crossref","award":["SGPCTRS1804"],"award-info":[{"award-number":["SGPCTRS1804"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"name":"MOE AcRF Tier 2","award":["2016-T2-1-170"],"award-info":[{"award-number":["2016-T2-1-170"]}]},{"name":"NRF","award":["NRF2016NCR-NCR002-028, PIESGP-AI-2018-01 and NRFF2018-07"],"award-info":[{"award-number":["NRF2016NCR-NCR002-028, PIESGP-AI-2018-01 and NRFF2018-07"]}]},{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation","doi-asserted-by":"crossref","award":["RGNRF1402"],"award-info":[{"award-number":["RGNRF1402"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2022,3,31]]},"abstract":"<jats:p>\n            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:\n            <jats:list list-type=\"simple\">\n              <jats:list-item>\n                <jats:label>-<\/jats:label>\n                <jats:p>Does the traffic stabilize?<\/jats:p>\n              <\/jats:list-item>\n              <jats:list-item>\n                <jats:label>-<\/jats:label>\n                <jats:p>Is the system behavior consistent with latency-minimizing agents?<\/jats:p>\n              <\/jats:list-item>\n              <jats:list-item>\n                <jats:label>-<\/jats:label>\n                <jats:p>Is the resulting system efficient?<\/jats:p>\n              <\/jats:list-item>\n            <\/jats:list>\n          <\/jats:p>\n          <jats:p>\n            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\n            <jats:italic>Free-flow Index (FFI)<\/jats:italic>\n            , 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.\n          <\/jats:p>","DOI":"10.1145\/3512747","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T09:06:33Z","timestamp":1649408793000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6940-974X","authenticated-orcid":false,"given":"Barnab\u00e9","family":"Monnot","sequence":"first","affiliation":[{"name":"Ethereum Foundation, Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4867-5149","authenticated-orcid":false,"given":"Francisco","family":"Benita","sequence":"additional","affiliation":[{"name":"Engineering and Systems Design, SUTD, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6236-3566","authenticated-orcid":false,"given":"Georgios","family":"Piliouras","sequence":"additional","affiliation":[{"name":"Engineering and Systems Design, SUTD, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0223-6"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41392-6_8"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139060035.002"},{"key":"e_1_3_4_5_2","unstructured":"Hillel Bar-Gera. 2011. Transportation network test problems. Retrieved 13 Feb. 2022 from http:\/\/www.bgu.ac.il\/bargera\/tntp\/."},{"key":"e_1_3_4_6_2","article-title":"Short-distance commuters in the smart city","author":"Benita Francisco","year":"2019","unstructured":"Francisco Benita, Garvit Bansal, Georgios Piliouras, and Bige Tun\u00e7er. 2019. Short-distance commuters in the smart city. arXiv:1902.08028. Retrieved from https:\/\/arxiv.org\/abs\/1902.08028.","journal-title":"arXiv:1902.08028"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.healthplace.2019.01.014"},{"key":"e_1_3_4_8_2","doi-asserted-by":"crossref","unstructured":"Francisco Benita Vittorio Bil\u00f2 Barnab\u00e9 Monnot Georgios Piliouras and Cosimo Vinci. 2020. Data-driven models of selfish routing: why price of anarchy does depend on network topology. In International Conference on Web and Internet Economics . Springer 252\u2013265.","DOI":"10.1007\/978-3-030-64946-3_18"},{"key":"e_1_3_4_9_2","first-page":"48","volume-title":"Proceedings of the Information and Communication Technology for Competitive Strategies","author":"Bil\u00f2 Vittorio","year":"2018","unstructured":"Vittorio Bil\u00f2 and Cosimo Vinci. 2018. The price of anarchy of affine congestion games with similar strategies. In Proceedings of the Information and Communication Technology for Competitive Strategies. 48\u201359."},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374430"},{"key":"e_1_3_4_11_2","first-page":"122","volume-title":"Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems","author":"Buriol Luciana","year":"2011","unstructured":"Luciana Buriol, Marcus Ritt, F\u00e9lix Rodrigues, and Guido Sch\u00e4fer. 2011. On the smoothed price of anarchy of the traffic assignment problem. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. ATMOS, 122\u2013133."},{"key":"e_1_3_4_12_2","unstructured":"Thiparat Chotibut Fryderyk Falniowski Michal Misiurewicz and Georgios Piliouras. 2019. The route to chaos in routing games: Population increase drives period-doubling instability chaos & inefficiency with price of anarchy equal to one. arXiv:1906.02486. http:\/\/arxiv.org\/abs\/1906.02486."},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71924-5_10"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9834-1"},{"key":"e_1_3_4_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.01.001"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2019.8795664"},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897580"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79309-0_12"},{"key":"e_1_3_4_19_2","volume-title":"Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science","author":"Gemici Kurtulus","year":"2019","unstructured":"Kurtulus Gemici, Elias Koutsoupias, Barnab\u00e9 Monnot, Christos H. Papadimitriou, and Georgios Piliouras. 2019. Wealth inequality and the price of anarchy. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_4_20_2","volume-title":"Proceedings of the Preliminary version at 1st Workshop on Algorithmic Game Theory and Data Science","author":"Hoy Darrell","year":"2015","unstructured":"Darrell Hoy, Denis Nekipelov, and Vasilis Syrgkanis. 2015. Robust data-driven guarantees in auctions. In Proceedings of the Preliminary version at 1st Workshop on Algorithmic Game Theory and Data Science."},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0197"},{"key":"e_1_3_4_22_2","unstructured":"Pooya Jalaly Denis Nekipelov and \u00c9va Tardos. 2017. Learning and trust in auction markets. arXiv:1703.10672. http:\/\/arxiv.org\/abs\/1703.10672."},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536487"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_4_25_2","unstructured":"Stefanos Leonardos Iosif Sakos Costas Courcoubetis and Georgios Piliouras. 2020. Catastrophe by Design in Population Games: Destabilizing Wasteful Locked-in Technologies. arXiv:2007.12877. Retrieved from https:\/\/arxiv.org\/abs\/2007.12877."},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch9"},{"key":"e_1_3_4_27_2","volume-title":"Proceedings of the Innovations in Theoretical Computer Science","author":"Mehta Ruta","year":"2015","unstructured":"Ruta Mehta, Ioannis Panageas, and Georgios Piliouras. 2015. Natural selection as an inhibitor of genetic diversity: Multiplicative weights updates algorithm and a conjecture of haploid genetics. In Proceedings of the Innovations in Theoretical Computer Science."},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71924-5_24"},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29643-2_19"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764522"},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035966"},{"key":"e_1_3_4_33_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1246"},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940784"},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2930956"},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_4_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536485"},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.5555\/3092750"},{"key":"e_1_3_4_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_4_40_2","volume-title":"Population Games and Evolutionary Dynamics","author":"Sandholm William H.","year":"2010","unstructured":"William H. Sandholm. 2010. Population Games and Evolutionary Dynamics. MIT Press."},{"key":"e_1_3_4_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2668332.2668343"},{"key":"e_1_3_4_42_2","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Sheffi Yosef","year":"1985","unstructured":"Yosef Sheffi. 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, New Jersey."},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2014.07.011"},{"key":"e_1_3_4_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/2845926.2845935"},{"key":"e_1_3_4_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jth.2018.01.002"},{"key":"e_1_3_4_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/HONET.2017.8102202"},{"key":"e_1_3_4_47_2","volume-title":"The Relevance of Street Patterns and Public Space in Urban Areas","year":"2013","unstructured":"UN-Habitat. 2013. The Relevance of Street Patterns and Public Space in Urban Areas. United Nations Human Settlements Programme (UNHSP), Nairobi, Kenya."},{"key":"e_1_3_4_48_2","volume-title":"Measurement of City Prosperity: Methodology and metadata","year":"2016","unstructured":"UN-Habitat. 2016. Measurement of City Prosperity: Methodology and metadata. United Nations Human Settlements Programme (UNHSP), Nairobi, Kenya."},{"key":"e_1_3_4_49_2","first-page":"1","volume-title":"Proceedings of the 96th Annual Meeting on Transportation Research Board","author":"Wilhelm Erik","year":"2017","unstructured":"Erik Wilhelm, Don MacKenzie, Yuren Zhou, Lynette Cheah, and Nils Ole Tippenhauer. 2017. Evaluation of transport mode using wearable sensor data from thousands of students. In Proceedings of the 96th Annual Meeting on Transportation Research Board. Transportation Research Board, 1\u201318."},{"key":"e_1_3_4_50_2","doi-asserted-by":"publisher","DOI":"10.3390\/g9020021"},{"key":"e_1_3_4_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2790405"},{"key":"e_1_3_4_52_2","article-title":"Power-saving transportation mode identification for large-scale applications","author":"Zhou Yuren","year":"2017","unstructured":"Yuren Zhou, Jin Wang, Peng Shi, Daniel Dahlmeier, Nils Tippenhauer, and Erik Wilhelm. 2017. Power-saving transportation mode identification for large-scale applications. arXiv:1701.05768 (2017). Retrieved from https:\/\/arxiv.org\/abs\/1701.05768.","journal-title":"arXiv:1701.05768"},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-2053-7_35"},{"key":"e_1_3_4_54_2","unstructured":"Wu Zijun Moehring Rolf H. Chen Yanyan and Xu Dachuan. 2020. Selfishness need not be bad. arXiv:1712.07464. Retrieved from https:\/\/arxiv.org\/abs\/1712.07464."}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512747","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:28Z","timestamp":1750183768000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,31]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3,31]]}},"alternative-id":["10.1145\/3512747"],"URL":"https:\/\/doi.org\/10.1145\/3512747","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,31]]},"assertion":[{"value":"2019-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}