{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:41:11Z","timestamp":1769827271016,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Control Netw. Syst."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tcns.2024.3355035","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T18:31:11Z","timestamp":1705516271000},"page":"1790-1799","source":"Crossref","is-referenced-by-count":5,"title":["Payoff-Based Learning of Nash Equilibria in Merely Monotone Games"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8951-112X","authenticated-orcid":false,"given":"Tatiana","family":"Tatarenko","sequence":"first","affiliation":[{"name":"Department of Control Theory and Robotics, TU Darmstadt, Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0230-3518","authenticated-orcid":false,"given":"Maryam","family":"Kamgarpour","sequence":"additional","affiliation":[{"name":"EPFL School of Engineering, Sycamore Lab, Lausanne, Switzerland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1115\/1.2766722"},{"key":"ref2","first-page":"257","article-title":"Highly-smooth zero-th order online optimization","volume-title":"Proc. Conf. Learn. Theory","author":"Bach","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1026-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-93-86279-38-5"},{"key":"ref5","first-page":"5661","article-title":"Bandit learning in concave n-person games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bravo","year":"2018"},{"key":"ref6","first-page":"33904","article-title":"Finite-time last-iterate convergence for learning in multi-player games","volume":"35","author":"Cai","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2014.2311122"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728716"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.14.1.42"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-007-0054-4"},{"key":"ref12","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Flaxman","year":"2005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9992906"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.08.005"},{"key":"ref15","first-page":"6372","article-title":"Learning with bandit feedback in potential games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Heliou","year":"2017"},{"key":"ref16","first-page":"6544","article-title":"No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation","volume":"35","author":"Hsieh","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref17","first-page":"6938","article-title":"On the convergence of single-call stochastic extra-gradient methods","volume-title":"Proc. 33rd Int. Conf. Neural Inf. Process. Syst.","author":"Hsieh","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2020.12.029"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-048-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717489"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2215413"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/20M1381678"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2011.2174059"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2013.2257780"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2012.03.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/070680199"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.172"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref30","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Pang","year":"2003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2995666"},{"key":"ref32","volume-title":"Introduction to optimization","author":"Poljak","year":"1987"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/1911749"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2186410"},{"key":"ref35","first-page":"636","article-title":"Improved regret guarantees for online smooth convex optimization with bandit feedback","volume-title":"Proc. Int. Conf. Artif. Intell.Statist.","author":"Saha","year":"2011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2265-4_4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2841319"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029659"},{"key":"ref39","article-title":"Bandit learning in convex non-strictly monotone games","author":"Tatarenko","year":"2020"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2007.907533"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9052-5"}],"container-title":["IEEE Transactions on Control of Network Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6509490\/10865803\/10402042-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6509490\/10865803\/10402042.pdf?arnumber=10402042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,3]],"date-time":"2025-02-03T18:30:00Z","timestamp":1738607400000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10402042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcns.2024.3355035","relation":{},"ISSN":["2325-5870","2372-2533"],"issn-type":[{"value":"2325-5870","type":"electronic"},{"value":"2372-2533","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}