{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:55Z","timestamp":1750307335810,"version":"3.41.0"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p>Network routing games are used to understand the impact of individual users' decisions on network efficiency. Prior work on routing games uses a simplified model of network flow where all flow exists simultaneously. In our work, we examine routing games in a flow-over-time model. We show that by reducing network capacity judiciously, the network owner can ensure that the equilibrium is no worse than a small constant times the optimal in the original network, for two natural measures of optimality. These are the first upper bounds on the price of anarchy in the flow-over-time model for general networks.<\/jats:p>","DOI":"10.1145\/1998549.1998554","type":"journal-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T13:47:26Z","timestamp":1308664046000},"page":"23-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A competitive strategy for routing flow over time"],"prefix":"10.1145","volume":"10","author":[{"given":"Umang","family":"Bhaskar","sequence":"first","affiliation":[{"name":"Dartmouth College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Fleischer","sequence":"additional","affiliation":[{"name":"Dartmouth College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elliot","family":"Anshelevich","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Bhaskar U. Fleischer L. and Anshelevich E. 2011. A Stackelberg strategy for routing flow over time. In SODA. 192--201.   Bhaskar U. Fleischer L. and Anshelevich E. 2011. A Stackelberg strategy for routing flow over time. In SODA . 192--201.","DOI":"10.1137\/1.9781611973082.18"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109630"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Cominetti R. Correa J. and Larre O. 2011. Existence and uniqueness of equilibria for ows over time. In ICALP. To appear.   Cominetti R. Correa J. and Larre O. 2011. Existence and uniqueness of equilibria for ows over time. In ICALP . To appear.","DOI":"10.1007\/978-3-642-22012-8_44"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ford L. R. and Fulkerson D. R. 1962. Flows in Networks. Princeton University Press.  Ford L. R. and Fulkerson D. R. 1962. Flows in Networks . Princeton University Press.","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_5_1","unstructured":"Koch R. and Skutella M. 2008. Nash equilibria and the price of anarchy for flows over time. Tech. rep. Available at http:\/\/opus4.kobv.de\/opus4-matheon\/frontdoor\/index\/index\/docId\/530.  Koch R. and Skutella M. 2008. Nash equilibria and the price of anarchy for flows over time. Tech. rep. Available at http:\/\/opus4.kobv.de\/opus4-matheon\/frontdoor\/index\/index\/docId\/530."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_29"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Macko M. Larson K. and Steskal L. 2010. Braess's paradox for flows over time. In SAGT. 262--275.   Macko M. Larson K. and Steskal L. 2010. Braess's paradox for flows over time. In SAGT . 262--275.","DOI":"10.1007\/978-3-642-16170-4_23"},{"key":"e_1_2_1_8_1","volume-title":"Dynasmart-P Version 1.0 User's Guide. Maryland Transport Initiative","author":"Mahmassani H. S.","year":"2004","unstructured":"Mahmassani , H. S. , Sbayti , H. , and Zhou , X . Dynasmart-P Version 1.0 User's Guide. Maryland Transport Initiative , College Park , Maryland , 2004 . Mahmassani, H. S., Sbayti, H., and Zhou, X. Dynasmart-P Version 1.0 User's Guide. Maryland Transport Initiative, College Park, Maryland, 2004."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00044-8"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998549.1998554","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998549.1998554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:13Z","timestamp":1750244773000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998549.1998554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1145\/1998549.1998554"],"URL":"https:\/\/doi.org\/10.1145\/1998549.1998554","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2011,6]]},"assertion":[{"value":"2011-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}