{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:21:25Z","timestamp":1783110085905,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819543663","type":"print"},{"value":"9789819543670","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"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-981-95-4367-0_36","type":"book-chapter","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:37:56Z","timestamp":1763728676000},"page":"537-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Generalized Nash Equilibrium Learning for\u00a0Online Multi-cluster Games with\u00a0Bandit Feedback"],"prefix":"10.1007","author":[{"given":"Bingqian","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanghui","family":"Wen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"36_CR1","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning, pp. 928\u2013936 (2003)"},{"issue":"5","key":"36_CR2","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1109\/TAC.2020.3002592","volume":"66","author":"K Lu","year":"2021","unstructured":"Lu, K., Li, G., Wang, L.: Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments. IEEE Trans. Autom. Control 66(5), 2289\u20132296 (2021)","journal-title":"IEEE Trans. Autom. Control"},{"key":"36_CR3","unstructured":"Meng, M., Li, X., Hong, Y., Chen, J., Wang, L.: Decentralized online learning for noncooperative games in dynamic environments. arXiv preprint arXiv:2105.06200 (2021)"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.automatica.2018.05.020","volume":"95","author":"M Ye","year":"2018","unstructured":"Ye, M., Hu, G., Lewis, F.L.: Nash equilibrium seeking for N-coalition non-cooperative games. Automatica 95, 266\u2013272 (2018)","journal-title":"Automatica"},{"issue":"11","key":"36_CR5","doi-asserted-by":"publisher","first-page":"4645","DOI":"10.1109\/TAC.2019.2901820","volume":"64","author":"M Ye","year":"2019","unstructured":"Ye, M., Hu, G., Lewis, F.L., Xie, L.: A unified strategy for solution seeking in graphical N-coalition noncooperative games. IEEE Trans. Autom. Control 64(11), 4645\u20134652 (2019)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"36_CR6","doi-asserted-by":"publisher","first-page":"3675","DOI":"10.1109\/TCYB.2022.3155687","volume":"53","author":"J Zhou","year":"2023","unstructured":"Zhou, J., Lv, Y., Wen, G., Lu, J., Zheng, D.: Distributed Nash equilibrium seeking in consistency-constrained multicoalition games. IEEE Trans. Cybern. 53(6), 3675\u20133687 (2023)","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1109\/TCNS.2023.3339304","volume":"11","author":"R Yu","year":"2024","unstructured":"Yu, R., Meng, M., Li, L.: Distributed online learning for leaderless multicluster games in dynamic environments. IEEE Trans. Control Netw. Syst. 11(3), 1548\u20131561 (2024)","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"6","key":"36_CR8","doi-asserted-by":"publisher","first-page":"4050","DOI":"10.1109\/TAC.2023.3342850","volume":"69","author":"M Meng","year":"2024","unstructured":"Meng, M., Li, X., Chen, J.: Decentralized Nash equilibria learning for online game with bandit feedback. IEEE Trans. Autom. Control 69(6), 4050\u20134057 (2024)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"36_CR9","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1109\/TAC.2023.3327183","volume":"69","author":"J Li","year":"2024","unstructured":"Li, J., Li, C., Fan, J., Huang, T.: Online distributed stochastic gradient algorithm for nonconvex optimization with compressed communication. IEEE Trans. Autom. Control 69(2), 936\u2013951 (2024)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1109\/TAC.2005.843878","volume":"50","author":"JS Shamma","year":"2005","unstructured":"Shamma, J.S., Arslan, G.: Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria. IEEE Trans. Autom. Control 50(3), 312\u2013327 (2005)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"9","key":"36_CR11","doi-asserted-by":"publisher","first-page":"4811","DOI":"10.1109\/TAC.2017.2688452","volume":"62","author":"M Ye","year":"2017","unstructured":"Ye, M., Hu, G.: Distributed Nash equilibrium seeking by a consensus based approach. IEEE Trans. Autom. Control 62(9), 4811\u20134818 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"36_CR12","first-page":"1703","volume":"18","author":"O Shamir","year":"2017","unstructured":"Shamir, O.: An optimal algorithm for bandit and zero-order convex optimization with two-point feedback. J. Mach. Learn. Res. 18(1), 1703\u20131713 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"issue":"11","key":"36_CR14","doi-asserted-by":"publisher","first-page":"3045","DOI":"10.1109\/TCYB.2017.2755720","volume":"48","author":"D Yuan","year":"2018","unstructured":"Yuan, D., Ho, D.W.C., Jiang, G.P.: An adaptive primal-dual subgradient algorithm for online distributed constrained optimization. IEEE Trans. Cybern. 48(11), 3045\u20133055 (2018)","journal-title":"IEEE Trans. Cybern."},{"key":"36_CR15","volume-title":"Distributed online generalized Nash Equilibrium learning in multi-cluster games: A delay-tolerant algorithm","author":"B Liu","year":"2025","unstructured":"Liu, B., Wen, G., Fang, X., Huang, T., Chen, G.: Distributed online generalized Nash Equilibrium learning in multi-cluster games: A delay-tolerant algorithm. IEEE Trans. Circuits Syst. I Regul, Pap (2025)"},{"issue":"4","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J. Optim. 19(4), 1757\u20131780 (2009)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4367-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:43:25Z","timestamp":1783107805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4367-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,22]]},"ISBN":["9789819543663","9789819543670"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4367-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,22]]},"assertion":[{"value":"22 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okinawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2025.apnns.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}