{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:17:57Z","timestamp":1771697877666,"version":"3.50.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T00:00:00Z","timestamp":1561852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2019,6,30]]},"abstract":"<jats:p>\n            The impact of the recent increase in routing apps usage on road traffic remains uncertain to this day. The article introduces, for the first time, a criterion to evaluate a distance between an observed state of traffic and the user equilibrium of the traffic assignment:\n            <jats:italic>the average marginal regret<\/jats:italic>\n            . The average marginal regret provides a quantitative measure of the impact of routing apps on traffic using only link flows, link travel times, and travel demand. In non-atomic routing games (or static traffic assignment models), the average marginal regret is a measure of selfish drivers\u2019 behaviors. Unlike the\n            <jats:italic>price of anarchy<\/jats:italic>\n            , the average marginal regret in the routing game can be computed in polynomial time without any knowledge of user equilibria and socially optimal states of traffic. First, this article demonstrates on a small example that the average marginal regret is more appropriate to define proximity between an observed state of traffic and an user equilibrium state of traffic than comparing flows, travel times, or total cost. Then, experiments on two different models of app usage and three networks (including the whole L.A. network with more than 50,000 nodes) demonstrate that the average marginal regret decreases with an increase of app usage. Sensitivity analysis of the equilibrium state with respect to the app usage ratio proves that the average marginal regret monotonically decreases to 0 with an increase of app usage. Finally, using a toy example, the article concludes that app usage could become the new Braess paradox.\n          <\/jats:p>","DOI":"10.1145\/3325916","type":"journal-article","created":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T12:15:03Z","timestamp":1563797703000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Regrets in Routing Networks"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9670-4437","authenticated-orcid":false,"given":"Th\u00e9ophile","family":"Cabannes","sequence":"first","affiliation":[{"name":"University of California, Berkeley, CA"}]},{"given":"Marco","family":"Sangiovanni","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}]},{"given":"Alexander","family":"Keimer","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}]},{"given":"Alexandre M.","family":"Bayen","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Dynamic Noncooperative Game Theory","author":"Basar Tamer"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146392"},{"key":"e_1_2_1_3_1","volume-title":"Regret Minimization, and Equilibria","author":"Blum Avrim"},{"key":"e_1_2_1_4_1","volume-title":"HCM 2010: Highway Capacity Manual. Retrieved from: https:\/\/search.library.wisc.edu\/catalog\/9910110589002121","author":"Board Transportation Research","year":"2010"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Geoff Boeing. 2016. OSMnx: New methods for acquiring constructing analyzing and visualizing complex street networks. Retrieved from: http:\/\/arxiv.org\/abs\/1611.01890.  Geoff Boeing. 2016. OSMnx: New methods for acquiring constructing analyzing and visualizing complex street networks. Retrieved from: http:\/\/arxiv.org\/abs\/1611.01890.","DOI":"10.2139\/ssrn.2865501"},{"key":"e_1_2_1_6_1","volume-title":"Convex Optimization","author":"Boyd Stephen"},{"key":"e_1_2_1_7_1","first-page":"258","article-title":"\u00dcber ein Paradoxon aus der Verkehrsplanung","volume":"12","author":"Braess Dietrich","year":"1968","journal-title":"Unternehmensforschung"},{"key":"e_1_2_1_8_1","volume-title":"AppleMaps 42M. Geoawesomeness (Oct.","author":"Buczkowski Aleks","year":"2014"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 97th Transportation Research Board Meeting. Retrieved from: https:\/\/trid.trb.org\/view\/1495267","author":"Cabannes Th\u00e9ophile"},{"key":"e_1_2_1_10_1","unstructured":"Cartesian. 2015. The rise of mobile phones 20 years of global adoption. Retrieved from: http:\/\/blog.cartesian.com\/the-rise-of-mobile-phones-20-years-of-global-adoption.  Cartesian. 2015. The rise of mobile phones 20 years of global adoption. Retrieved from: http:\/\/blog.cartesian.com\/the-rise-of-mobile-phones-20-years-of-global-adoption."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","volume-title":"Prediction, Learning, and Games","author":"Cesa-Bianchi Nicolo","DOI":"10.1017\/CBO9780511546921"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms10793"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612357"},{"key":"e_1_2_1_14_1","volume-title":"Transportation Energy Data Book. Edition 22","author":"Davis Stacy"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/090746720"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(84)90029-8"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.12.3.208"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2800001"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 21st International Conference on Intelligent Transportation Systems (ITSC\u201918)","author":"Khiyami A."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3044805.3044911"},{"key":"e_1_2_1_21_1","unstructured":"Mobile Sensing lab. {n.d.}. Open source static traffic assignment solver. Retrieved from: https:\/\/github.com\/megacell.  Mobile Sensing lab. {n.d.}. Open source static traffic assignment solver. Retrieved from: https:\/\/github.com\/megacell."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(91)90145-G"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_2_1_24_1","volume-title":"Network Economics: A Variational Inequality Approach","author":"Nagurney A.","year":"1998"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"e_1_2_1_26_1","volume-title":"\u201cinsanity","author":"News CBS","year":"2018"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"N. Nisam T. Roughgarden E. Tardos and V. V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press.   N. Nisam T. Roughgarden E. Tardos and V. V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_2_1_28_1","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"Patriksson M."},{"key":"e_1_2_1_29_1","volume-title":"da Silva","author":"Ramos Gabriel","year":"2018"},{"key":"e_1_2_1_30_1","unstructured":"Joe Fitzgerald Rodriguez. 2016. 45 000 Uber and Lyft drivers may now operate in SF. SF Examiner (Nov. 2016). http:\/\/www.sfexaminer.com\/45000-uber-lyft-drivers-may-now-operate-san-francisco-drivers-continue-multiply\/.  Joe Fitzgerald Rodriguez. 2016. 45 000 Uber and Lyft drivers may now operate in SF. SF Examiner (Nov. 2016). http:\/\/www.sfexaminer.com\/45000-uber-lyft-drivers-may-now-operate-san-francisco-drivers-continue-multiply\/."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","volume-title":"Selfish Routing and the Price of Anarchy","author":"Roughgarden Tim","DOI":"10.21236\/ADA637949"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2696"},{"key":"e_1_2_1_35_1","unstructured":"Ben Stabler. {n.d.}. Open source transportation networks. Retrieved from: https:\/\/github.com\/bstabler\/TransportationNetworks.  Ben Stabler. {n.d.}. Open source transportation networks. Retrieved from: https:\/\/github.com\/bstabler\/TransportationNetworks."},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 21st IEEE International Conference on Intelligent Transportation Systems (ITSC\u201918)","author":"Cabannes T."},{"key":"e_1_2_1_37_1","volume-title":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC). 595--601","author":"Thai J."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11362"},{"key":"e_1_2_1_39_1","unstructured":"wiki.waze.com. {n.d.}. The routing server of Waze. Retrieved from: https:\/\/wiki.waze.com\/wiki\/Routing_server.  wiki.waze.com. {n.d.}. The routing server of Waze. Retrieved from: https:\/\/wiki.waze.com\/wiki\/Routing_server."}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3325916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3325916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:08Z","timestamp":1750204388000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3325916"}},"subtitle":["Measuring the Impact of Routing Apps in Traffic"],"short-title":[],"issued":{"date-parts":[[2019,6,30]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6,30]]}},"alternative-id":["10.1145\/3325916"],"URL":"https:\/\/doi.org\/10.1145\/3325916","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,30]]},"assertion":[{"value":"2018-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}