{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:29:36Z","timestamp":1783610976155,"version":"3.55.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Department of Computer Science, North Carolina Agricultural"},{"name":"Technical State University through Google Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsipn.2025.3579245","type":"journal-article","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T13:44:55Z","timestamp":1749735895000},"page":"752-766","source":"Crossref","is-referenced-by-count":1,"title":["Online Non-Convex Non-Cooperative Cluster-Based Games With Byzantine Resiliency in Decentralized Multi-Agent Systems"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6569-6211","authenticated-orcid":false,"given":"Olusola T.","family":"Odeyomi","sequence":"first","affiliation":[{"name":"Department of Computer Science, North Carolina Agricultural and Technical State University, Greensboro, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1412-3138","authenticated-orcid":false,"given":"Temitayo O.","family":"Olowu","sequence":"additional","affiliation":[{"name":"Idaho National Laboratory, Idaho Falls, ID, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Opeyemi","family":"Ajibuwa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, North Carolina Agricultural and Technical State University, Greensboro, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1179-3221","authenticated-orcid":false,"given":"Abdollah","family":"Homaifar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, North Carolina Agricultural and Technical State University, Greensboro, NC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2017.2668983"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA.2013.6566347"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s43684-022-00045-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544853"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3439744"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2994024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3033389"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2946287"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3194369"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2018.2878250"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3244070"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4324\/9781003547983-16"},{"key":"ref14","article-title":"Non-cooperative games with many players","author":"Khan","year":"2022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.10.028"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2018.2846732"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.26599\/AIR.2022.9150002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105506"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2023.3300354"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/PESGM46819.2021.9638127"},{"key":"ref21","article-title":"Cluster games: A novel, game theory-based approach to better understand incentives and stability in clusters","author":"Gedai","year":"2012","journal-title":"Inst. Innov. Technol., Danish Agency Sci. Technol. Innov."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2756934"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2024.3397294"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3213316"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2688452"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008113"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3046232"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2022.110317"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3264164"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3002592"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/140980685"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1063\/5.0155863"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3091096"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2024.111834"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3008139"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526806"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3291677"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref39","article-title":"Zeno: Byzantine-suspicious stochastic gradient descent","author":"Xie","year":"2018"},{"key":"ref40","first-page":"10495","article-title":"Zeno : Robust asynchronous SGD with arbitrary number of byzantine workers","author":"Xie","year":"2020","journal-title":"Proc. Int. conf. mach. learn."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"ref42","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"Blanchard","year":"2017","journal-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst."},{"key":"ref43","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yin","year":"2018"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2022.3188456"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3116976"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2928176"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110046"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3300629"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3209010"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2023.3267160"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.23919\/ACC60939.2024.10644516"},{"key":"ref52","first-page":"380","article-title":"Problem complexity and method efficiency in optimization","author":"Nemirovskij","year":"1983"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2987379"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2013.6580866"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526803"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2019018"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2023.3325815"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.191"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2525928"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2650563"},{"key":"ref62","first-page":"1433","article-title":"Efficient regret minimization in non-convex games","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hazan","year":"2017"},{"key":"ref63","first-page":"123","article-title":"From optimization and variational inequalities to equilibrium problems","volume":"63","author":"Blum","year":"1994","journal-title":"Math. Student"},{"key":"ref64","first-page":"1","article-title":"Tutorial: Mirror descent algorithms for large-scale deterministic and stochastic convex optimization","volume-title":"Proc. Conf. Learn. Theory","author":"Nemirovski","year":"2012"},{"key":"ref65","first-page":"374","article-title":"A randomized mirror descent algorithm for large scale multiple kernel learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Afkanpour","year":"2013"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3185116"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/20M1361158"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2025.3526967"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2008.02.007"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.07.020"},{"key":"ref71","first-page":"261","article-title":"Fall of empires: Breaking byzantine-tolerant SGD by inner product manipulation","volume-title":"Proc. Uncertainty Artif. Intell.","author":"Xie","year":"2020"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3290049"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6884276\/10789318\/11031241.pdf?arnumber=11031241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T17:57:13Z","timestamp":1753379833000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11031241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2025.3579245","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"value":"2373-776X","type":"electronic"},{"value":"2373-7778","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}