Online Distributed Algorithms for Seeking Generalized Nash Equilibria in Dynamic Environments

In this article, we study the distributed generalized Nash equilibrium (GNE) seeking problem of noncooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action set. The action sets of all players are coupled through...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 66; H. 5; S. 2289 - 2296
Hauptverfasser: Lu, Kaihong, Li, Guangqi, Wang, Long
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.05.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0018-9286, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In this article, we study the distributed generalized Nash equilibrium (GNE) seeking problem of noncooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action set. The action sets of all players are coupled through a shared convex inequality constraint. Each player can only have access to its own cost function, its own set constraint, and a local block of the inequality constraint, and can only communicate with its neighbors via a connected graph. Moreover, players do not have prior knowledge of their future cost functions. To address this problem, an online distributed algorithm is proposed based on consensus algorithms and a primal-dual strategy. The performance of the algorithm is measured by using dynamic regrets. Under mild assumptions on graphs and cost functions, we prove that if the deviation of the variational GNE sequence increases within a certain rate, then the regrets, as well as the violation of inequality constraint, grow sublinearly. A simulation is presented to demonstrate the effectiveness of our theoretical results.
AbstractList In this article, we study the distributed generalized Nash equilibrium (GNE) seeking problem of noncooperative games in dynamic environments. Each player in the game aims to minimize its own time-varying cost function subject to a local action set. The action sets of all players are coupled through a shared convex inequality constraint. Each player can only have access to its own cost function, its own set constraint, and a local block of the inequality constraint, and can only communicate with its neighbors via a connected graph. Moreover, players do not have prior knowledge of their future cost functions. To address this problem, an online distributed algorithm is proposed based on consensus algorithms and a primal-dual strategy. The performance of the algorithm is measured by using dynamic regrets. Under mild assumptions on graphs and cost functions, we prove that if the deviation of the variational GNE sequence increases within a certain rate, then the regrets, as well as the violation of inequality constraint, grow sublinearly. A simulation is presented to demonstrate the effectiveness of our theoretical results.
Author Wang, Long
Lu, Kaihong
Li, Guangqi
Author_xml – sequence: 1
  givenname: Kaihong
  orcidid: 0000-0002-5265-7800
  surname: Lu
  fullname: Lu, Kaihong
  email: khong_lu@163.com
  organization: Center for Complex Systems, School of Mechano-electronic Engineering, Xidian University, Xi'an, China
– sequence: 2
  givenname: Guangqi
  orcidid: 0000-0002-4004-8354
  surname: Li
  fullname: Li, Guangqi
  email: gqli@xidian.edu.cn
  organization: Center for Complex Systems, School of Mechano-electronic Engineering, Xidian University, Xi'an, China
– sequence: 3
  givenname: Long
  orcidid: 0000-0001-5600-8157
  surname: Wang
  fullname: Wang, Long
  email: longwang@pku.edu.cn
  organization: Center for Systems and Control, College of Engineering, Peking University, Beijing, China
BookMark eNp9kE1LAzEQQIMo2Kp3wUvA89ZMPrabY6m1CkUP1qMs2Wy2jm6zNUkF_fWutHjw4GkYeG8G3pAc-s47Qs6BjQCYvlpOpiPOOBsJxrjS_IAMQKki44qLQzJgDIpM8yI_JsMYX_s1lxIG5PnBt-gdvcaYAlbb5Go6aVddwPSyjrTpAn107g39is6dd8G0-NUj9ya-0Nn7FlusAhqKnl5_erNGS2f-A0Pn186neEqOGtNGd7afJ-TpZrac3maLh_nddLLILNeQMp7XUhaVa7hggktV5ZXUNbPAlJJKjxsrG25qAc5yYS1UDQNdg4ZGFsIyK07I5e7uJnTvWxdT-dptg-9fllzBmAmhx6Kn8h1lQxdjcE1pMZmEnU_BYFsCK39Sln3K8idluU_Zi-yPuAm4NuHzP-Vip6Bz7hfXAGMohPgGWHaAew
CODEN IETAA9
CitedBy_id crossref_primary_10_1109_TAC_2024_3419818
crossref_primary_10_1016_j_automatica_2025_112598
crossref_primary_10_1007_s43684_021_00004_0
crossref_primary_10_1109_TCNS_2023_3339304
crossref_primary_10_1109_TCSII_2022_3213316
crossref_primary_10_1109_TMC_2023_3334589
crossref_primary_10_1016_j_sysconle_2021_105002
crossref_primary_10_1109_TAC_2024_3379253
crossref_primary_10_1109_TAC_2024_3419018
crossref_primary_10_1007_s11768_023_00166_7
crossref_primary_10_1109_TAC_2024_3510596
crossref_primary_10_1002_asjc_2904
crossref_primary_10_1109_TAC_2023_3239432
crossref_primary_10_1109_TCSII_2022_3179576
crossref_primary_10_1016_j_arcontrol_2023_100904
crossref_primary_10_1007_s40747_023_01172_7
crossref_primary_10_1109_TPAMI_2024_3445666
crossref_primary_10_3390_math11102295
crossref_primary_10_1002_rnc_6314
crossref_primary_10_1109_TAC_2023_3342850
crossref_primary_10_1109_TSIPN_2025_3579245
crossref_primary_10_1109_TAC_2023_3308343
crossref_primary_10_1109_TSMC_2023_3282800
crossref_primary_10_1016_j_eswa_2024_124315
crossref_primary_10_1109_TASE_2025_3595443
crossref_primary_10_1109_TSG_2023_3308055
crossref_primary_10_1038_s41598_025_86683_8
crossref_primary_10_1109_TCNS_2023_3337671
crossref_primary_10_1109_TSMC_2024_3525011
crossref_primary_10_1109_TCNS_2024_3432250
crossref_primary_10_1109_TAC_2023_3237781
crossref_primary_10_1016_j_neucom_2024_128213
crossref_primary_10_1109_TAC_2023_3264164
crossref_primary_10_1109_TCYB_2022_3195361
crossref_primary_10_1016_j_automatica_2025_112200
crossref_primary_10_1109_TAC_2023_3288372
crossref_primary_10_1007_s11431_023_2513_8
crossref_primary_10_1007_s11432_022_3777_y
crossref_primary_10_1109_JAS_2023_123126
crossref_primary_10_1109_TAC_2025_3552141
crossref_primary_10_1109_TAC_2024_3424345
crossref_primary_10_1109_TNNLS_2023_3290049
Cites_doi 10.1109/TPWRS.2014.2356255
10.1016/j.automatica.2006.02.013
10.23919/ECC.2018.8550331
10.1109/JSTSP.2015.2404790
10.1109/TCYB.2016.2524452
10.1109/TAC.2019.2922953
10.1016/j.automatica.2019.01.008
10.1109/TAC.2017.2672902
10.1109/TAC.2011.2174678
10.1016/j.automatica.2018.05.020
10.1017/CBO9780511804458.013
10.1007/s10107-007-0149-x
10.1109/LCSYS.2017.2718842
10.1109/TCOMM.2009.02.070158
10.1109/TAC.2015.2414817
10.1109/TAC.2017.2688452
10.1109/TAC.2010.2041610
10.1109/TAC.2017.2743462
10.1016/j.automatica.2017.07.064
10.1016/j.automatica.2014.10.034
10.1109/TCYB.2018.2828118
10.1007/s11432-007-0044-3
10.1109/TAC.2018.2833140
10.1017/CBO9781139020411
10.1016/j.automatica.2017.09.016
10.1109/TAC.2019.2915745
10.1109/TCNS.2018.2813928
10.1016/j.automatica.2016.06.004
10.1109/MSP.2020.2968813
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1109/TAC.2020.3002592
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
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
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2523
EndPage 2296
ExternalDocumentID 10_1109_TAC_2020_3002592
9117183
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: 61751301; 61533001
  funderid: 10.13039/501100001809
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-c291t-26d448bef2303245b6b49d0c10554597fc4f2ad31ec23cc1bf019d191f483c0c3
IEDL.DBID RIE
ISICitedReferencesCount 51
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000642765200029&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 Mon Jun 30 10:09:31 EDT 2025
Sat Nov 29 05:40:59 EST 2025
Tue Nov 18 22:19:04 EST 2025
Wed Aug 27 02:30:55 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
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-c291t-26d448bef2303245b6b49d0c10554597fc4f2ad31ec23cc1bf019d191f483c0c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4004-8354
0000-0002-5265-7800
0000-0001-5600-8157
PQID 2517033973
PQPubID 85475
PageCount 8
ParticipantIDs crossref_citationtrail_10_1109_TAC_2020_3002592
crossref_primary_10_1109_TAC_2020_3002592
proquest_journals_2517033973
ieee_primary_9117183
PublicationCentury 2000
PublicationDate 2021-05-01
PublicationDateYYYYMMDD 2021-05-01
PublicationDate_xml – month: 05
  year: 2021
  text: 2021-05-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on automatic control
PublicationTitleAbbrev TAC
PublicationYear 2021
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
ref12
ref15
ref14
ref31
ref30
ref11
ref10
ref2
ref1
ref17
ref16
ref19
gadjov (ref32) 2019
ref18
facchinei (ref29) 2003
ref24
ref23
ref26
ref25
ref20
ref22
ref28
ref27
ref8
ref7
ref9
ref4
ref3
ref6
ref5
bastianello (ref21) 2020
References_xml – ident: ref2
  doi: 10.1109/TPWRS.2014.2356255
– ident: ref24
  doi: 10.1016/j.automatica.2006.02.013
– ident: ref16
  doi: 10.23919/ECC.2018.8550331
– ident: ref19
  doi: 10.1109/JSTSP.2015.2404790
– ident: ref9
  doi: 10.1109/TCYB.2016.2524452
– ident: ref14
  doi: 10.1109/TAC.2019.2922953
– ident: ref15
  doi: 10.1016/j.automatica.2019.01.008
– ident: ref11
  doi: 10.1109/TAC.2017.2672902
– ident: ref1
  doi: 10.1109/TAC.2011.2174678
– ident: ref8
  doi: 10.1016/j.automatica.2018.05.020
– year: 2019
  ident: ref32
  article-title: Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting
– ident: ref28
  doi: 10.1017/CBO9780511804458.013
– ident: ref27
  doi: 10.1007/s10107-007-0149-x
– ident: ref12
  doi: 10.1109/LCSYS.2017.2718842
– ident: ref18
  doi: 10.1109/TCOMM.2009.02.070158
– ident: ref31
  doi: 10.1109/TAC.2015.2414817
– year: 2020
  ident: ref21
  article-title: Distributed and inexact proximal gradient method for online convex optimization
– ident: ref7
  doi: 10.1109/TAC.2017.2688452
– ident: ref26
  doi: 10.1109/TAC.2010.2041610
– ident: ref23
  doi: 10.1109/TAC.2017.2743462
– ident: ref13
  doi: 10.1016/j.automatica.2017.07.064
– ident: ref3
  doi: 10.1016/j.automatica.2014.10.034
– ident: ref17
  doi: 10.1109/TCYB.2018.2828118
– ident: ref25
  doi: 10.1007/s11432-007-0044-3
– year: 2003
  ident: ref29
  publication-title: Finite-Dimensional Variational Inequalities and Complementarity Problems
– ident: ref10
  doi: 10.1109/TAC.2018.2833140
– ident: ref30
  doi: 10.1017/CBO9781139020411
– ident: ref6
  doi: 10.1016/j.automatica.2017.09.016
– ident: ref22
  doi: 10.1109/TAC.2019.2915745
– ident: ref4
  doi: 10.1109/TCNS.2018.2813928
– ident: ref5
  doi: 10.1016/j.automatica.2016.06.004
– ident: ref20
  doi: 10.1109/MSP.2020.2968813
SSID ssj0016441
Score 2.5915122
Snippet In this article, we study the distributed generalized Nash equilibrium (GNE) seeking problem of noncooperative games in dynamic environments. Each player in...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2289
SubjectTerms Algorithms
Consensus
Consensus algorithm
Cost function
distributed algorithm
Distributed algorithms
Game theory
Games
Heuristic algorithms
Nash equilibrium (NE)
noncooperative game
online algorithm
Power system dynamics
Title Online Distributed Algorithms for Seeking Generalized Nash Equilibria in Dynamic Environments
URI https://ieeexplore.ieee.org/document/9117183
https://www.proquest.com/docview/2517033973
Volume 66
WOSCitedRecordID wos000642765200029&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
  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/eLvHCXMwlV3PS8MwFH5sw4Me_DXF6ZQcvAjWtU27NMexH3gaghN2kdImqSvMTrfOg3-9L2lXJorgrdCkLXnNe-9L8r4P4FowKhNPMSvGYGB53HMsjl7Q8hPFhC-oxHtGbIKNx8F0yh9qcFvVwiilzOEzdacvzV6-XIi1Xirr4MREV0rrUGeMFbVa1Y6BjuuF1w3026otSZt3Jr0-AkEX8amO8Nz9FoKMpsoPR2yiy-jgf991CPtlFkl6hdmPoKayY9jb4hZswnNBIkoGmhlXi1opSXrzl8UyzWevK4K5KnlUSi-Uk5J6Ov3EJuNoNSPD93VqagEikmZkUIjWk-FWTdwJPI2Gk_69VWopWMLlTm65XYlALFYJQg7Mofy4G3tc2kLrY3oIKhLhJW4kqaOES4Vw4gRzP4lgLvECKmxBT6GRLTJ1BgRDnvDtrmScaXDtREwixKb4AKYCFdkt6GyGNxQl0bjWu5iHBnDYPESDhNogYWmQFtxUPd4Kko0_2ja1Aap25di3oL2xYFjOwlWo6dhsihkXPf-91wXsuvqMijnA2IZGvlyrS9gRH3m6Wl6ZH-wL0oXMqg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD54A_XB2xTnNQ--CNa1Tbo2j0M3FOcQnOCLlDZJXWFuunY--Os9SbuiKIJvhSZtyWnOOV-S830AJ8KnMmHKt2IMBhbjzLE4ekHLS5QvPEEl3jNiE36vFzw-8rs5OKtqYZRS5vCZOteXZi9fjsVUL5U1cGKiK6XzsOgx5jpFtVa1Z6Aje-F3A_2-alPS5o1-6wKhoIsIVcd47n4LQkZV5YcrNvGls_6_L9uAtTKPJK3C8Jswp0ZbsPqFXbAGTwWNKLnU3Lha1kpJ0ho-jydpPnjJCGar5F4pvVROSvLp9AOb9KJsQNpv09RUA0QkHZHLQraetL9UxW3DQ6fdv7iySjUFS7jcyS23KRGKxSpB0IFZlBc3Y8alLbRCJkNYkQiWuJGkjhIuFcKJE8z-JMK5hAVU2ILuwMJoPFK7QDDoCc9uSp_7Gl47kS8RZFN8gK8CFdl1aMyGNxQl1bhWvBiGBnLYPESDhNogYWmQOpxWPV4Lmo0_2ta0Aap25djX4WBmwbCch1moCdlsijkX3fu91zEsX_Vvu2H3unezDyuuPrFijjMewEI-mapDWBLveZpNjszP9gmig8_x
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=Online+Distributed+Algorithms+for+Seeking+Generalized+Nash+Equilibria+in+Dynamic+Environments&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Lu%2C+Kaihong&rft.au=Li%2C+Guangqi&rft.au=Wang%2C+Long&rft.date=2021-05-01&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=66&rft.issue=5&rft.spage=2289&rft.epage=2296&rft_id=info:doi/10.1109%2FTAC.2020.3002592&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TAC_2020_3002592
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