Distributed Nash Equilibrium Computation Under Round-Robin Scheduling Protocol

This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is perm...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control Vol. 69; no. 1; pp. 339 - 346
Main Authors: Feng, Zhangcheng, Xu, Wenying, Cao, Jinde
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0018-9286, 1558-2523
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is permitted to transmit data to only one of its neighbors at each time instant. The resulting protocol-induced communication graph become time-varying and even disconnected, even though the original graph is assumed to be strongly connected. The aim of the addressed problem is to develop a distributed algorithm in the partial-decision information setting such the convergence of NE can be guaranteed under the <inline-formula><tex-math notation="LaTeX">B</tex-math></inline-formula>-strong connectivity of graphs and the row-stochasticity of weighted adjacency matrix. The sufficient condition on the convergence of the NE is derived for the algorithm with diminishing step-sizes. Some discussions are provided on convergence rate of the proposed algorithm. Finally, one numerical example is provided to verify the developed algorithm.
AbstractList This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is permitted to transmit data to only one of its neighbors at each time instant. The resulting protocol-induced communication graph become time-varying and even disconnected, even though the original graph is assumed to be strongly connected. The aim of the addressed problem is to develop a distributed algorithm in the partial-decision information setting such the convergence of NE can be guaranteed under the <inline-formula><tex-math notation="LaTeX">B</tex-math></inline-formula>-strong connectivity of graphs and the row-stochasticity of weighted adjacency matrix. The sufficient condition on the convergence of the NE is derived for the algorithm with diminishing step-sizes. Some discussions are provided on convergence rate of the proposed algorithm. Finally, one numerical example is provided to verify the developed algorithm.
This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is permitted to transmit data to only one of its neighbors at each time instant. The resulting protocol-induced communication graph become time-varying and even disconnected, even though the original graph is assumed to be strongly connected. The aim of the addressed problem is to develop a distributed algorithm in the partial-decision information setting such the convergence of NE can be guaranteed under the [Formula Omitted]-strong connectivity of graphs and the row-stochasticity of weighted adjacency matrix. The sufficient condition on the convergence of the NE is derived for the algorithm with diminishing step-sizes. Some discussions are provided on convergence rate of the proposed algorithm. Finally, one numerical example is provided to verify the developed algorithm.
Author Cao, Jinde
Xu, Wenying
Feng, Zhangcheng
Author_xml – sequence: 1
  givenname: Zhangcheng
  orcidid: 0009-0008-7283-5310
  surname: Feng
  fullname: Feng, Zhangcheng
  email: 220211757@seu.edu.cn
  organization: School of Mathematics, Southeast University, Nanjing, China
– sequence: 2
  givenname: Wenying
  orcidid: 0000-0002-6110-9160
  surname: Xu
  fullname: Xu, Wenying
  email: wyxu@seu.edu.cn
  organization: School of Mathematics, Southeast University, Nanjing, China
– sequence: 3
  givenname: Jinde
  orcidid: 0000-0003-3133-7119
  surname: Cao
  fullname: Cao, Jinde
  email: jdcao@seu.edu.cn
  organization: School of Mathematics, Frontiers Science Center for Mobile Information Communication and Security, Southeast University, Nanjing, China
BookMark eNp9kLtOwzAUQC1UJEphZ2CIxJziVxJ7rEJ5SFVBpZ0j27Gpq9RunXjg70mVDoiBybrSOffK5xqMnHcagDsEpwhB_rielVMMMZkSnGNK4QUYoyxjKc4wGYExhIilHLP8Cly37a4fc0rRGCyfbNsFK2On62Qp2m0yP0bbWBls3Cel3x9iJzrrXbJxtQ7JykdXpysvrUs-1VbXsbHuK_kIvvPKNzfg0oim1bfndwI2z_N1-Zou3l_eytkiVZjjLtWEGGUQldBwpHWBuNTM1KLOpRFFDY3SihLJSa56QmJijGAIMwnzWlMmyAQ8DHsPwR-jbrtq52Nw_ckKc1hkFHPKeiofKBV82wZtKmWH33RB2KZCsDq1q_p21alddW7Xi_CPeAh2L8L3f8r9oFit9S8cMoILRH4A_ol9Qw
CODEN IETAA9
CitedBy_id crossref_primary_10_1002_rnc_70069
crossref_primary_10_1109_TSIPN_2025_3600831
crossref_primary_10_1109_TAC_2025_3559743
crossref_primary_10_1002_rnc_70027
crossref_primary_10_1109_TSIPN_2024_3402354
crossref_primary_10_1016_j_automatica_2024_111925
crossref_primary_10_1109_JSEN_2025_3582166
Cites_doi 10.1109/TWC.2017.2747145
10.1109/TSP.2010.2043138
10.53941/ijndi0101003
10.1109/TIE.2016.2539259
10.1109/TAC.2020.2995666
10.1109/TAC.2016.2610945
10.1109/TAC.2020.3008113
10.1016/j.automatica.2015.01.008
10.1007/s10957-010-9737-7
10.23919/ECC51009.2020.9143714
10.1109/TAC.2008.2009515
10.1109/tac.2022.3226142
10.1109/CDC42340.2020.9304267
10.1109/TAC.2005.843878
10.2307/1907353
10.53941/ijndi0101008
10.53941/ijndi0101006
10.1109/TAC.2020.3005922
10.1016/j.automatica.2016.07.025
10.1016/j.automatica.2021.109661
10.1080/00207721.2021.1917721
10.1109/TCYB.2020.3022240
10.1109/TAC.2018.2862471
10.1109/TIT.2014.2317791
10.1007/978-1-4419-9467-7
10.1109/CDC.2017.8264224
10.1016/j.ejor.2004.04.026
10.1109/TAC.2019.2922953
10.1109/TIT.2008.926399
10.1109/TAC.2020.2969721
10.1007/978-3-319-67540-4_1
10.1016/j.automatica.2021.110080
10.1109/LCSYS.2020.3002734
10.1145/1963405.1963433
10.1287/opre.2016.1501
10.1109/TCYB.2019.2941870
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1109/TAC.2023.3262440
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE/IET Electronic Library (IEL) (UW System Shared)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2523
EndPage 346
ExternalDocumentID 10_1109_TAC_2023_3262440
10083271
Genre orig-research
GrantInformation_xml – fundername: Fundamental Research Funds for the Central Universities
  funderid: 10.13039/501100012226
– fundername: National Natural Science Foundation of China
  grantid: 62173087; 61833005
  funderid: 10.13039/501100001809
– fundername: Alexander von Humboldt Foundation of Germany
– fundername: ZhiShan Youth Scholar Program from Southeast University
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
VJK
~02
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c292t-e33fcf14b0f91ee719be8fdad6bfa7d0fcec43b936c0f9b23ffa8128b06de48a3
IEDL.DBID RIE
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001163003600065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9286
IngestDate Wed Aug 20 14:41:02 EDT 2025
Sat Nov 29 05:41:08 EST 2025
Tue Nov 18 22:44:18 EST 2025
Wed Aug 27 02:02:24 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c292t-e33fcf14b0f91ee719be8fdad6bfa7d0fcec43b936c0f9b23ffa8128b06de48a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0009-0008-7283-5310
0000-0003-3133-7119
0000-0002-6110-9160
PQID 2907542948
PQPubID 85475
PageCount 8
ParticipantIDs proquest_journals_2907542948
crossref_citationtrail_10_1109_TAC_2023_3262440
crossref_primary_10_1109_TAC_2023_3262440
ieee_primary_10083271
PublicationCentury 2000
PublicationDate 2024-Jan.
2024-1-00
20240101
PublicationDateYYYYMMDD 2024-01-01
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-Jan.
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on automatic control
PublicationTitleAbbrev TAC
PublicationYear 2024
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref12
ref34
ref15
ref37
ref14
ref36
ref31
ref30
Brckner (ref9) 2012; 13
ref11
ref33
ref10
ref32
Kenneth (ref1) 1954; 22
ref2
ref17
ref39
ref16
ref38
ref19
ref18
ref23
ref26
ref25
ref20
ref22
ref21
Nguyen (ref24) 2022
ref28
ref29
ref8
ref7
Facchinei (ref27) 2003
ref4
ref3
ref6
ref5
References_xml – ident: ref20
  doi: 10.1109/TWC.2017.2747145
– ident: ref6
  doi: 10.1109/TSP.2010.2043138
– ident: ref10
  doi: 10.53941/ijndi0101003
– ident: ref18
  doi: 10.1109/TIE.2016.2539259
– ident: ref36
  doi: 10.1109/TAC.2020.2995666
– ident: ref35
  doi: 10.1109/TAC.2016.2610945
– ident: ref33
  doi: 10.1109/TAC.2020.3008113
– volume: 13
  start-page: 2617
  issue: 1
  year: 2012
  ident: ref9
  article-title: Static prediction games for adversarial learning problems
  publication-title: J. Mach. Learn. Res.
– ident: ref7
  doi: 10.1016/j.automatica.2015.01.008
– ident: ref29
  doi: 10.1007/s10957-010-9737-7
– ident: ref28
  doi: 10.23919/ECC51009.2020.9143714
– ident: ref30
  doi: 10.1109/TAC.2008.2009515
– ident: ref39
  doi: 10.1109/tac.2022.3226142
– ident: ref22
  doi: 10.1109/CDC42340.2020.9304267
– ident: ref13
  doi: 10.1109/TAC.2005.843878
– volume: 22
  start-page: 265
  issue: 3
  year: 1954
  ident: ref1
  article-title: Existence of an equilibrium for a competitive economy
  publication-title: Econometrica, J. Econometric Soc.
  doi: 10.2307/1907353
– ident: ref3
  doi: 10.53941/ijndi0101008
– ident: ref8
  doi: 10.53941/ijndi0101006
– ident: ref26
  doi: 10.1109/TAC.2020.3005922
– ident: ref19
  doi: 10.1016/j.automatica.2016.07.025
– ident: ref37
  doi: 10.1016/j.automatica.2021.109661
– ident: ref17
  doi: 10.1080/00207721.2021.1917721
– ident: ref38
  doi: 10.1109/TCYB.2020.3022240
– ident: ref34
  doi: 10.1109/TAC.2018.2862471
– ident: ref11
  doi: 10.1109/TIT.2014.2317791
– ident: ref32
  doi: 10.1007/978-1-4419-9467-7
– ident: ref12
  doi: 10.1109/CDC.2017.8264224
– ident: ref4
  doi: 10.1016/j.ejor.2004.04.026
– ident: ref15
  doi: 10.1109/TAC.2019.2922953
– ident: ref2
  doi: 10.1109/TIT.2008.926399
– ident: ref31
  doi: 10.1109/TAC.2020.2969721
– year: 2022
  ident: ref24
  article-title: Distributed Nash equilibrium seeking over time-varying directed communication networks
– ident: ref25
  doi: 10.1007/978-3-319-67540-4_1
– ident: ref16
  doi: 10.1016/j.automatica.2021.110080
– volume-title: Finite-Dimensional Variational Inequalities and Complementarity Problems
  year: 2003
  ident: ref27
– ident: ref23
  doi: 10.1109/LCSYS.2020.3002734
– ident: ref5
  doi: 10.1145/1963405.1963433
– ident: ref14
  doi: 10.1287/opre.2016.1501
– ident: ref21
  doi: 10.1109/TCYB.2019.2941870
SSID ssj0016441
Score 2.5042849
Snippet This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 339
SubjectTerms Algorithm design and analysis
Algorithms
Convergence
Design of experiments
Directed graphs
Distributed algorithms
Distributed computation
game
Game theory
Graph theory
Nash equilibrium
Nash equilibrium (NE)
Protocols
Round robin
round-robin (RR)
Title Distributed Nash Equilibrium Computation Under Round-Robin Scheduling Protocol
URI https://ieeexplore.ieee.org/document/10083271
https://www.proquest.com/docview/2907542948
Volume 69
WOSCitedRecordID wos001163003600065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library (IEL) (UW System Shared)
  customDbUrl:
  eissn: 1558-2523
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0016441
  issn: 0018-9286
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagYoCBZxGFgjywMKRNYyexx6oUMaCogoK6RY59hkrQQJvw-7GdtCpCILFlOFvRfbbP53t8CF0S24YOmPQiGUiPcqU8QRX3mDD2RlIIuauQe7qLk4RNJnxUF6u7WhgAcMln0LGfLpavclnap7KubURDAlsxvhnHUVWstQoZWMNeHbtmBwdsFZP0eXfcH3QsTXjH3FWMOfO_2SBHqvLjJHbm5Wbvnz-2j3breyTuV8AfoA2YHaKdte6CRyi5tk1xLZ8VKJyIxQsefpRTl-NfvuGKzsHhgh35Eb63DEueKwjDDwZLZZPUn_Fonhe5WS5N9HgzHA9uvZo-wZMBDwoPCNFS92jma94DiHs8A6aVUFGmRax8LUFSknESSSORBURrYcw9y_xIAWWCHKPGLJ_BCcKKxirkxOcyljSUShivkLCQZiETQKDXQt2lQlNZ9xa3FBevqfMxfJ4aCFILQVpD0EJXqxHvVV-NP2SbVuVrcpW2W6i9BC2td94iDYy3bzm4KDv9ZdgZ2jaz0-odpY0axbyEc7QlP4vpYn7hFtUXiurKRQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG8MmqgHPzGiqD148TAYa8faI0EIRlyIouG2dO2bkihTYP79tt0gGKOJtx1e0-X92r6-vo8fQpfEtKEDJp2m9KRDuVKOoIo7TGh7Iyn43FbIPfWDMGSjER8Uxeq2FgYAbPIZ1MynjeWrVGbmqaxuGtEQz1SMr_uUem5errUMGhjTnh-8eg97bBmVdHl92GrXDFF4Td9WtEFzv1khS6vy4yy2Bqa7-89f20M7xU0St3Lo99EaTA7Q9kp_wUMUXpu2uIbRChQOxewFdz6ysc3yz95wTuhgkcGW_gjfG44lx5aE4QeNpjJp6s94ME3nqV4wZfTY7QzbPacgUHCkx725A4QkMmnQ2E14AyBo8BhYooRqxokIlJtIkJTEnDSllog9kiRCG3wWu00FlAlyhEqTdALHCCsaKJ8Tl8tAUl8qof1Cwnwa-0wAgUYF1RcKjWTRXdyQXLxG1stweaQhiAwEUQFBBV0tR7znnTX-kC0bla_I5dquoOoCtKjYe7PI0_6-YeGi7OSXYRdosze860f9m_D2FG3pmWj-qlJFpfk0gzO0IT_n49n03C6wLzoozYw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Nash+Equilibrium+Computation+Under+Round-Robin+Scheduling+Protocol&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Feng%2C+Zhangcheng&rft.au=Xu%2C+Wenying&rft.au=Cao%2C+Jinde&rft.date=2024-01-01&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=69&rft.issue=1&rft.spage=339&rft.epage=346&rft_id=info:doi/10.1109%2FTAC.2023.3262440&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TAC_2023_3262440
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon