{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:25:48Z","timestamp":1767320748885,"version":"3.48.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032085597","type":"print"},{"value":"9783032085603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08560-3_29","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:38Z","timestamp":1767320618000},"page":"513-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergence to\u00a0Equilibrium of\u00a0No-Regret Dynamics in\u00a0Congestion Games"],"prefix":"10.1007","author":[{"given":"Volkan","family":"Cevher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leello","family":"Dadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Panageas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Skoulakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Viano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"29_CR1","unstructured":"Abernethy, J.D., Hazan, E., Rakhlin, A.: Competing in the dark: an efficient algorithm for bandit linear optimization (2009)"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/moor.2013.0598","volume":"39","author":"JY Audibert","year":"2014","unstructured":"Audibert, J.Y., Bubeck, S., Lugosi, G.: Regret in online combinatorial optimization. Math. Oper. Res. 39(1), 31\u201345 (2014)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 45\u201353 (2004)","DOI":"10.1145\/1007352.1007367"},{"key":"29_CR5","unstructured":"Brown, G.W.: Some notes on computation of games solutions. Technical report, Rand Corp Santa Monica CA (1949)"},{"key":"29_CR6","unstructured":"Bubeck, S., Cesa-Bianchi, N., Kakade, S.M.: Towards minimax policies for online linear optimization with bandit feedback. In: Mannor, S., Srebro, N., Williamson, R.C. (eds.) COLT 2012 - The 25th Annual Conference on Learning Theory, Edinburgh, Scotland, 25\u201327 June 2012. JMLR Proceedings, vol.\u00a023, pp. 41.1\u201341.14. JMLR.org (2012)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"issue":"5","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jcss.2012.01.001","volume":"78","author":"N Cesa-Bianchi","year":"2012","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. J. Comput. Syst. Sci. 78(5), 1404\u20131422 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR9","unstructured":"Chen, P.A., Lu, C.J.: Playing congestion games with bandit feedbacks. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems (2015)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.artint.2016.09.002","volume":"241","author":"PA Chen","year":"2016","unstructured":"Chen, P.A., Lu, C.J.: Generalized mirror descents in congestion games. Artif. Intell. 241, 217\u2013243 (2016)","journal-title":"Artif. Intell."},{"key":"29_CR11","unstructured":"Chen, W., Wang, Y., Yuan, Y.: Combinatorial multi-armed bandit: general framework and applications. In: International Conference on Machine Learning (2013)"},{"key":"29_CR12","unstructured":"Chen, X., Peng, B.: Hedging in games: faster convergence of external and swap regrets. In: Advances in Neural Information Processing Systems (2020)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Cheung, M.H., Southwell, R., Huang, J.: Congestion-aware network selection and data offloading. In: 2014 48th Annual Conference on Information Sciences and Systems (CISS), pp.\u00a01\u20136. IEEE (2014)","DOI":"10.1109\/CISS.2014.6814132"},{"key":"29_CR14","unstructured":"Cohen, J., H\u00e9liou, A., Mertikopoulos, P.: Exponentially fast convergence to (strict) equilibrium via hedging. arXiv preprint arXiv:1607.08863 (2016)"},{"key":"29_CR15","unstructured":"Combes, R., Talebi Mazraeh\u00a0Shahi, M.S., Proutiere, A., et\u00a0al.: Combinatorial bandits revisited. In: Advances in Neural Information Processing Systems (2015)"},{"key":"29_CR16","unstructured":"Cui, Q., Xiong, Z., Fazel, M., Du, S.S.: Learning in congestion games with bandit feedback. In: Advances in Neural Information Processing Systems (2022)"},{"key":"29_CR17","unstructured":"Dadi, L., Panageas, I., Skoulakis, S., Viano, L., Cevher, V.: Polynomial convergence of bandit no-regret dynamics in congestion games. arXiv preprint arXiv:2401.09628 (2024)"},{"key":"29_CR18","unstructured":"Dani, V., Hayes, T.P., Kakade, S.M.: The price of bandit information for online optimization. In: Proceedings of the 20th International Conference on Neural Information Processing Systems, NIPS 2007, pp. 345\u2013352. Curran Associates Inc., Red Hook, NY, USA (2007)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Deckelbaum, A., Kim, A.: Near-optimal no-regret algorithms for zero-sum games. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011)","DOI":"10.1137\/1.9781611973082.21"},{"key":"29_CR20","unstructured":"Daskalakis, C., Fishelson, M., Golowich, N.: Near-optimal no-regret learning in general games. In: Advances in Neural Information Processing Systems (2021)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Pan, Q.: A counter-example to Karlin\u2019s strong conjecture for fictitious play. In: IEEE 55th Annual Symposium on Foundations of Computer Science (2014)","DOI":"10.1109\/FOCS.2014.10"},{"key":"29_CR22","unstructured":"Dong, J., Wu, J., Wang, S., Wang, B., Chen, W.: Taming the exponential action set: sublinear regret and fast convergence to Nash equilibrium in online congestion games. arXiv preprint arXiv:2306.13673 (2023)"},{"key":"29_CR23","unstructured":"Flaxman, A.D., Kalai, A.T., McMahan, H.B.: Online convex optimization in the bandit setting: gradient descent without a gradient. arXiv preprint cs\/0408007 (2004)"},{"key":"29_CR24","unstructured":"Giannou, A., Vlatakis-Gkaragkounis, E.V., Mertikopoulos, P.: On the rate of convergence of regularized learning in games: from bandits and uncertainty to optimism and beyond. In: Advances in Neural Information Processing Systems (2021)"},{"key":"29_CR25","first-page":"2369","volume":"8","author":"A Gy\u00f6rgy","year":"2007","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G., Ottucs\u00e1k, G.: The on-line shortest path problem under partial monitoring. J. Mach. Learn. Res. 8, 2369\u20132403 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"29_CR26","unstructured":"Hsieh, Y.G., Antonakopoulos, K., Mertikopoulos, P.: Adaptive learning in continuous games: optimal regret bounds and convergence to Nash equilibrium. In: Conference on Learning Theory (2021)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3), 291\u2013307 (2005), learning Theory 2003","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Multiplicative updates outperform generic no-regret learning in congestion games. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing (2009)","DOI":"10.1145\/1536414.1536487"},{"issue":"2","key":"29_CR29","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1137\/140980685","volume":"53","author":"W Krichene","year":"2015","unstructured":"Krichene, W., Drigh\u00e8s, B., Bayen, A.M.: Online learning of Nash equilibria in congestion games. SIAM J. Control. Optim. 53(2), 1056\u20131081 (2015)","journal-title":"SIAM J. Control. Optim."},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"29_CR31","unstructured":"Neu, G., Bart\u00f3k, G.: An efficient algorithm for learning with semi-bandit feedback. In: Jain, S., Munos, R., Stephan, F., Zeugmann, T. (eds.) Algorithmic Learning Theory - 24th International Conference, ALT 2013, Singapore, 6\u20139 October 2013. Proceedings. LNCS, vol.\u00a08139, pp. 234\u2013248. Springer, Cham (2013)"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"29_CR33","unstructured":"Palaiopanos, G., Panageas, I., Piliouras, G.: Multiplicative weights update with constant step-size in congestion games: convergence, limit cycles and chaos. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"29_CR34","unstructured":"Panageas, I., Skoulakis, S., Viano, L., Wang, X., Cevher, V.: Semi bandit dynamics in congestion games: convergence to Nash equilibrium and no-regret guarantees (2023)"},{"key":"29_CR35","unstructured":"Panageas, I., Skoulakis, S., Viano, L., Wang, X., Cevher, V.: Semi bandit dynamicsin congestion games: convergence to Nash equilibrium and no-regret guarantees. In: International Conference on Machine Learning (2023)"},{"key":"29_CR36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"29_CR37","first-page":"459","volume":"18","author":"T Roughgarden","year":"2007","unstructured":"Roughgarden, T.: Routing games. Algorithmic Game Theory 18, 459\u2013484 (2007)","journal-title":"Algorithmic Game Theory"},{"key":"29_CR38","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"issue":"2","key":"29_CR39","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"key":"29_CR40","unstructured":"Syrgkanis, V., Agarwal, A., Luo, H., Schapire, R.E.: Fast convergence of regularized learning in games. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"issue":"5","key":"29_CR41","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1109\/TNET.2012.2182779","volume":"20","author":"C Tekin","year":"2012","unstructured":"Tekin, C., Liu, M., Southwell, R., Huang, J., Ahmad, S.H.A.: Atomic congestion games on graphs and their applications in networking. IEEE\/ACM Trans. Netw. 20(5), 1541\u20131552 (2012)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"29_CR42","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1109\/JIOT.2020.3008009","volume":"8","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Wang, M.M.: Stochastic congestion game for load balancing in mobile-edge computing. IEEE Internet Things J. 8(2), 778\u2013790 (2020)","journal-title":"IEEE Internet Things J."},{"key":"29_CR43","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Fawcett, T., Mishra, N. (eds.) Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), Washington, DC, USA, 21\u201324 August 2003, pp. 928\u2013936. AAAI Press (2003)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08560-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:23:41Z","timestamp":1767320621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08560-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032085597","9783032085603"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08560-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}