{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:48:51Z","timestamp":1768348131412,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146392","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"45-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Routing without regret"],"prefix":"10.1145","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Eyal","family":"Even-Dar","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA"}]},{"given":"Katrina","family":"Ligett","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029569"},{"key":"e_1_3_2_1_3_1","volume-title":"Studies in the Economics of Transportation","author":"Beckmann M.","year":"1956","unstructured":"M. Beckmann , C. B. McGuire , and C. B. Winsten . Studies in the Economics of Transportation . Yale University Press , 1956 . M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109597"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258179"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509952"},{"key":"e_1_3_2_1_7_1","first-page":"413","volume-title":"Proc. 13th Annual ACM-SIAM Symp. Discrete Algorithms","author":"Czumaj A.","year":"2002","unstructured":"A. Czumaj and B. V\u00f6cking . Tight bounds on worst case equilibria . In Proc. 13th Annual ACM-SIAM Symp. Discrete Algorithms , pages 413 -- 420 , 2002 . A. Czumaj and B. V\u00f6cking. Tight bounds on worst case equilibria. In Proc. 13th Annual ACM-SIAM Symp. Discrete Algorithms, pages 413--420, 2002."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759261"},{"key":"e_1_3_2_1_9_1","first-page":"772","volume-title":"Proc. 16th Annual ACM-SIAM Symp. Discrete Algorithms","author":"Even-Dar E.","year":"2005","unstructured":"E. Even-Dar and Y. Mansour . Fast convergence of selfish rerouting . In Proc. 16th Annual ACM-SIAM Symp. Discrete Algorithms , pages 772 -- 781 , 2005 . E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Annual ACM-SIAM Symp. Discrete Algorithms, pages 772--781, 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872088"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132608"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_30"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073868"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1997.0595"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0738"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011787"},{"key":"e_1_3_2_1_18_1","first-page":"97","volume-title":"Contributions to the Theory of Games","author":"Hannan J.","year":"1957","unstructured":"J. Hannan . Approximation to Bayes risk in repeated play . In M. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games , volume III , pages 97 -- 139 . Princeton University Press , 1957 . J. Hannan. Approximation to Bayes risk in repeated play. In M. Dresher, A. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume III, pages 97--139. Princeton University Press, 1957."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00153"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27819-1_8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0027"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875585"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/648301.755475"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11362"},{"key":"e_1_3_2_1_29_1","first-page":"928","volume-title":"Proceedings of the 20th International Conference on Machine Learning","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In Proceedings of the 20th International Conference on Machine Learning , pages 928 -- 936 , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning, pages 928--936, 2003."},{"key":"e_1_3_2_1_30_1","volume-title":"Technical Report CMU-CS-04-161","author":"Zinkevich M.","year":"2004","unstructured":"M. Zinkevich . Theoretical guarantees for algorithms in multi-agent settings. Technical Report CMU-CS-04-161 , Carnegie Mellon University , 2004 . M. Zinkevich. Theoretical guarantees for algorithms in multi-agent settings. Technical Report CMU-CS-04-161, Carnegie Mellon University, 2004."}],"event":{"name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","location":"Denver Colorado USA","acronym":"PODC06","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T23:59:00Z","timestamp":1673481540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146392"}},"subtitle":["on convergence to nash equilibria of regret-minimizing algorithms in routing games"],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":30,"alternative-id":["10.1145\/1146381.1146392","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146392","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}