Event‐triggered distributed algorithm for searching general Nash equilibrium with general step‐size

Summary In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous‐time event‐triggered distributed subgradie...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimal control applications & methods Jg. 42; H. 2; S. 526 - 547
Hauptverfasser: Li, Ran, Mu, Xiaowu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Glasgow Wiley Subscription Services, Inc 01.03.2021
Schlagworte:
ISSN:0143-2087, 1099-1514
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Summary In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous‐time event‐triggered distributed subgradient projective algorithm (C‐ETDSP algorithm), to greatly cut down the number of communication flows, is designed. In the C‐ETDSP algorithm, the demand for step‐size is weakened to a general step‐size of square nonsummable. Then it is proved that the Zeno behavior did not exist in the continuous‐time event‐triggered mechanism. In addition, the convergence of different types of step‐sizes is further compared. Finally, the effectiveness of the design algorithm and the correctness of the theoretical results are verified by a simulation example.
AbstractList Summary In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous‐time event‐triggered distributed subgradient projective algorithm (C‐ETDSP algorithm), to greatly cut down the number of communication flows, is designed. In the C‐ETDSP algorithm, the demand for step‐size is weakened to a general step‐size of square nonsummable. Then it is proved that the Zeno behavior did not exist in the continuous‐time event‐triggered mechanism. In addition, the convergence of different types of step‐sizes is further compared. Finally, the effectiveness of the design algorithm and the correctness of the theoretical results are verified by a simulation example.
In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous‐time event‐triggered distributed subgradient projective algorithm (C‐ETDSP algorithm), to greatly cut down the number of communication flows, is designed. In the C‐ETDSP algorithm, the demand for step‐size is weakened to a general step‐size of square nonsummable. Then it is proved that the Zeno behavior did not exist in the continuous‐time event‐triggered mechanism. In addition, the convergence of different types of step‐sizes is further compared. Finally, the effectiveness of the design algorithm and the correctness of the theoretical results are verified by a simulation example.
Author Li, Ran
Mu, Xiaowu
Author_xml – sequence: 1
  givenname: Ran
  orcidid: 0000-0003-3737-2660
  surname: Li
  fullname: Li, Ran
  organization: Information Engineering University
– sequence: 2
  givenname: Xiaowu
  orcidid: 0000-0002-5367-3466
  surname: Mu
  fullname: Mu, Xiaowu
  email: muxiaowu@zzu.edu.cn
  organization: Zhengzhou University
BookMark eNp1kE1OwzAQhS1UJNqCxBEisWGTMnaSxl5WVfmRKrqBdeQ4k9RVmrS2Q1VWHIEzchJcilggWM2M5ntvNG9Aek3bICGXFEYUgN20So7YmPMT0qcgREgTGvdIH2gchQx4ekYG1q4AIKUR65Nq9oKN-3h7d0ZXFRosgkJbP-Sd872sq9Zot1wHZWsCi9KopW6qoMIGjayDR2mXAW47Xevc6G4d7Dz8s7UON97a6lc8J6elrC1efNcheb6dPU3vw_ni7mE6mYeKiYiHSqhcQEHHkFCeFCIpxRgiVbKYgywSjBMAlUPEIxQsT2WRFzRB_0qhWIxpFA3J1dF3Y9pth9Zlq7YzjT-ZsVjEKSTjlHtqdKSUaa01WGZKO-l02zgjdZ1RyA5hZj7M7BCmF1z_EmyMXkuz_wsNj-hO17j_l8sW08kX_wlShYhh
CitedBy_id crossref_primary_10_1002_asjc_2904
crossref_primary_10_1109_TCYB_2025_3572496
crossref_primary_10_1109_TSMC_2023_3249901
crossref_primary_10_1002_oca_3111
crossref_primary_10_1016_j_ifacol_2023_10_118
crossref_primary_10_3390_math11102295
crossref_primary_10_1109_TAC_2024_3433069
crossref_primary_10_1109_TNNLS_2022_3201133
crossref_primary_10_1002_asjc_2899
crossref_primary_10_1002_oca_2821
crossref_primary_10_1109_TCSII_2021_3068176
crossref_primary_10_1002_rnc_6880
Cites_doi 10.1109/ALLERTON.2010.5706956
10.1007/s10107-011-0467-x
10.1016/j.jfranklin.2020.03.035
10.1109/TNNLS.2017.2651402
10.1016/j.automatica.2017.09.016
10.1109/TNNLS.2016.2549566
10.1109/TAC.2015.2416927
10.1109/TAC.2010.2041686
10.1109/TNNLS.2017.2652478
10.1016/j.automatica.2016.07.005
10.1109/TAC.2017.2688452
10.1109/TAC.2011.2167817
10.1109/TAC.2016.2610945
10.1016/j.automatica.2015.03.001
10.1109/TCYB.2018.2828118
10.1109/TAC.2017.2763782
10.1109/TAC.2018.2852602
10.1155/2017/5385708
10.1109/TAC.2018.2800760
10.1109/CDC.2015.7402401
10.1109/TAC.2012.2184199
10.1016/j.automatica.2017.07.064
10.1109/CDC.2014.7039553
10.1016/j.automatica.2015.11.014
10.1109/TAC.2013.2278132
10.1007/BF02869513
10.1016/j.automatica.2016.06.004
10.1016/S0167-6911(99)00070-5
10.1109/TAC.2008.2009515
10.1109/TCSII.2018.2811803
10.1109/TAC.2017.2755374
10.1109/TAC.2007.895885
10.1109/TAC.2014.2364096
10.1109/CDC.2012.6426136
10.1002/rnc.4462
10.1109/TSMC.2016.2531649
10.1109/CDC.2014.7039537
10.1016/j.automatica.2015.11.015
ContentType Journal Article
Copyright 2020 John Wiley & Sons Ltd
2021 John Wiley & Sons, Ltd.
Copyright_xml – notice: 2020 John Wiley & Sons Ltd
– notice: 2021 John Wiley & Sons, Ltd.
DBID AAYXX
CITATION
7SP
8FD
JQ2
L7M
DOI 10.1002/oca.2688
DatabaseName CrossRef
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
ProQuest Computer Science Collection
DatabaseTitleList
Technology Research Database
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1099-1514
EndPage 547
ExternalDocumentID 10_1002_oca_2688
OCA2688
Genre article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  funderid: 11971444
GroupedDBID -~X
.3N
.GA
.Y3
05W
0R~
10A
123
1L6
1OB
1OC
31~
33P
3SF
3WU
4.4
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHQN
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABIJN
ABJNI
ABPVW
ACAHQ
ACBWZ
ACCZN
ACGFS
ACPOU
ACRPL
ACSCC
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADNMO
ADOZA
ADXAS
ADZMN
AEIGN
AEIMD
AENEX
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFWVQ
AFZJQ
AHBTC
AITYG
AIURR
AJXKR
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BMXJE
BNHUX
BROTX
BRXPI
BY8
CMOOK
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EBS
EJD
F00
F01
F04
FEDTE
G-S
G.N
GNP
GODZA
H.T
H.X
HBH
HF~
HGLYW
HHY
HVGLF
HZ~
I-F
IX1
J0M
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M59
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
NF~
NNB
O66
O9-
OIG
P2P
P2W
P2X
P4D
PALCI
Q.N
Q11
QB0
QRW
R.K
RIWAO
RJQFR
ROL
RWI
RX1
SAMSI
SUPJJ
TN5
TUS
UB1
UCJ
V2E
W8V
W99
WBKPD
WH7
WIH
WIK
WLBEL
WOHZO
WQJ
WRC
WWI
WXSBR
WYISQ
XG1
XPP
XV2
ZZTAW
~IA
~WT
AAMMB
AAYXX
AEFGJ
AEYWJ
AGHNM
AGQPQ
AGXDD
AGYGG
AIDQK
AIDYY
AIQQE
AMVHM
CITATION
O8X
7SP
8FD
JQ2
L7M
ID FETCH-LOGICAL-c2938-c9cb90d1605185d95f9603cf2480ad5e4500cb0383e92b7adbd15e713dc24e733
IEDL.DBID DRFUL
ISICitedReferencesCount 13
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000580456400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0143-2087
IngestDate Sun Nov 30 05:13:35 EST 2025
Sat Nov 29 04:09:55 EST 2025
Tue Nov 18 20:59:37 EST 2025
Wed Jan 22 16:31:28 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2938-c9cb90d1605185d95f9603cf2480ad5e4500cb0383e92b7adbd15e713dc24e733
Notes Funding information
National Natural Science Foundation of China, 11971444
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-3737-2660
0000-0002-5367-3466
PQID 2494705678
PQPubID 1036362
PageCount 22
ParticipantIDs proquest_journals_2494705678
crossref_citationtrail_10_1002_oca_2688
crossref_primary_10_1002_oca_2688
wiley_primary_10_1002_oca_2688_OCA2688
PublicationCentury 2000
PublicationDate March/April 2021
2021-03-00
20210301
PublicationDateYYYYMMDD 2021-03-01
PublicationDate_xml – month: 03
  year: 2021
  text: March/April 2021
PublicationDecade 2020
PublicationPlace Glasgow
PublicationPlace_xml – name: Glasgow
PublicationTitle Optimal control applications & methods
PublicationYear 2021
Publisher Wiley Subscription Services, Inc
Publisher_xml – name: Wiley Subscription Services, Inc
References 2017; 62
2010; 55
2018; 29
1966; 18
2017; 85
2012
2017; 2017
2017; 47
2010
2017; 28
2015; 55
2016; 73
2016; 72
2018; 63
2007; 52
2012; 57
2018; 87
2018; 65
2020; 8
2017; 50
2009; 54
2011; 129
2015; 60
2019; 64
2015; 63
1999; 38
2016; 65
2019; 49
2014; 59
2020; 357
2019; 29
2015
2014
e_1_2_7_6_1
e_1_2_7_5_1
e_1_2_7_4_1
e_1_2_7_3_1
e_1_2_7_9_1
e_1_2_7_8_1
e_1_2_7_7_1
e_1_2_7_19_1
e_1_2_7_18_1
e_1_2_7_17_1
e_1_2_7_16_1
e_1_2_7_40_1
e_1_2_7_2_1
e_1_2_7_15_1
e_1_2_7_41_1
e_1_2_7_14_1
e_1_2_7_13_1
e_1_2_7_12_1
e_1_2_7_11_1
e_1_2_7_10_1
e_1_2_7_27_1
e_1_2_7_28_1
e_1_2_7_29_1
Kajiyama Y (e_1_2_7_35_1) 2017; 50
e_1_2_7_30_1
e_1_2_7_25_1
e_1_2_7_31_1
e_1_2_7_24_1
e_1_2_7_32_1
e_1_2_7_23_1
e_1_2_7_33_1
e_1_2_7_22_1
e_1_2_7_34_1
e_1_2_7_21_1
e_1_2_7_20_1
e_1_2_7_36_1
e_1_2_7_38_1
e_1_2_7_39_1
Lu Q (e_1_2_7_37_1) 2017; 2017
Li R (e_1_2_7_26_1) 2020; 8
References_xml – volume: 29
  start-page: 981
  issue: 4
  year: 2018
  end-page: 992
  article-title: A collaborative neurodynamic approach to multiple‐objective distributed optimization
  publication-title: IEEE Trans Neural Netw Learn Syst
– volume: 72
  start-page: 209
  year: 2016
  end-page: 216
  article-title: Distributed Nash equilibrium seeking: a gossip‐based algorithm
  publication-title: Automatica
– volume: 38
  start-page: 235
  year: 1999
  end-page: 248
  article-title: Notions of input to output stability
  publication-title: Syst Control
– volume: 65
  start-page: 120
  year: 2016
  end-page: 131
  article-title: Distributed multi‐agent optimization subject to nonidentical constraints and communication delays
  publication-title: Automatica
– volume: 57
  start-page: 2348
  issue: 9
  year: 2012
  end-page: 2354
  article-title: Zero‐gradient‐sum algorithms for distributed convex optimization: the continuous‐time case
  publication-title: IEEE Trans Autom Control
– volume: 63
  start-page: 2248
  issue: 7
  year: 2018
  end-page: 2255
  article-title: Distributed subgradient method with edge‐based event‐triggered communication
  publication-title: IEEE Trans Autom Control
– volume: 62
  start-page: 3461
  issue: 7
  year: 2017
  end-page: 3467
  article-title: A multi‐agent system with a proportional integral protocol for distributed constrained optimization
  publication-title: IEEE Trans Autom Control
– volume: 64
  start-page: 1694
  issue: 4
  year: 2019
  end-page: 1701
  article-title: Continuous‐time distributed subgradient algorithm for convex optimization with general constraints
  publication-title: IEEE Trans Autom Control
– volume: 28
  start-page: 1747
  issue: 8
  year: 2017
  end-page: 1758
  article-title: A collective neurodynamic approach to distributed constrained optimization
  publication-title: IEEE Trans Neural Netw Learn Syst
– volume: 87
  start-page: 17
  year: 2018
  end-page: 24
  article-title: Distributed Nash equilibrium seeking in networked graphical games
  publication-title: Automatica
– volume: 57
  start-page: 151
  issue: 1
  year: 2012
  end-page: 164
  article-title: On distributed convex optimization under inequality and equality constraints
  publication-title: IEEE Trans Autom Control
– volume: 47
  start-page: 717
  issue: 5
  year: 2017
  end-page: 728
  article-title: Distributed optimization based on a multiagent system in the presence of communication delays
  publication-title: IEEE Trans Syst Man Cybern Syst
– volume: 62
  start-page: 4811
  issue: 9
  year: 2017
  end-page: 4818
  article-title: Distributed Nash equilibrium seeking by a consensus based approach
  publication-title: IEEE Trans Autom Control
– volume: 2017
  start-page: 1
  year: 2017
  end-page: 12
  article-title: Event‐triggered discrete‐time distributed consensus optimization over time‐varying graphs
  publication-title: Complexity
– volume: 85
  start-page: 179
  year: 2017
  end-page: 185
  article-title: Distributed Nash equilibrium seeking for aggregative games with coupled constraints
  publication-title: Automatica
– volume: 29
  start-page: 1840
  issue: 6
  year: 2019
  end-page: 1853
  article-title: Consensus analysis of hybrid multiagent systems: a game‐theoretic approach
  publication-title: Int J Robust Nonlinear Control
– volume: 18
  start-page: 13
  issue: 1
  year: 1966
  end-page: 28
  article-title: Optimal allocation of observations
  publication-title: Ann Inst Stat Math
– year: 2014
– volume: 357
  start-page: 4855
  issue: 8
  year: 2020
  end-page: 4868
  article-title: Distributed event‐triggered subgradient method for convex optimization with general step‐size
  publication-title: J Frankl Inst
– year: 2010
– year: 2012
– volume: 8
  start-page: 2169
  year: 2020
  end-page: 3536
  article-title: Distributed event‐triggered subgradient method for convex optimization with general step‐size
  publication-title: IEEE Access
– volume: 63
  start-page: 2295
  issue: 7
  year: 2018
  end-page: 2302
  article-title: Distributed subgradient‐based multiagent optimization with more general step size
  publication-title: IEEE Trans Autom Control
– volume: 65
  start-page: 2012
  issue: 12
  year: 2018
  end-page: 2016
  article-title: Bipartite consensus in networks of agents with antagonistic interactions and quantization
  publication-title: IEEE Trans Circ Syst II Exp Briefs
– volume: 60
  start-page: 3310
  issue: 12
  year: 2015
  end-page: 3315
  article-title: A second‐order multi‐agent network for bound constrained distributed optimization
  publication-title: IEEE Trans Autom Control
– volume: 29
  start-page: 1359
  issue: 4
  year: 2018
  end-page: 1365
  article-title: Consensus of hybrid multi‐agent systems
  publication-title: IEEE Trans Neural Netw Learn Syst
– volume: 52
  start-page: 968
  issue: 5
  year: 2007
  end-page: 969
  article-title: Comments on: coordination of groups of mobile autonomous agents using nearest neighbor rules
  publication-title: IEEE Trans Automatic Control
– volume: 73
  start-page: 20
  year: 2016
  end-page: 206
  article-title: Equilibrium topology of multi‐agent systems with two leaders: a zero‐sum game perspective
  publication-title: Automatica
– volume: 59
  start-page: 781
  issue: 3
  year: 2014
  end-page: 786
  article-title: Distributed continuous‐time convex optimization on weight‐balanced digraphs
  publication-title: IEEE Trans Autom Control
– volume: 49
  start-page: 2362
  issue: 6
  year: 2019
  end-page: 2371
  article-title: Distributed algorithms for searching generalized Nash equilibrium of noncooperative games
  publication-title: IEEE Trans Cybern
– volume: 55
  start-page: 992
  issue: 4
  year: 2010
  end-page: 938
  article-title: Constrained consensus and optimization in multi‐agent networks
  publication-title: IEEE Trans Autom Control
– volume: 55
  start-page: 254
  year: 2015
  end-page: 264
  article-title: Distributed convex optimization via continuous‐time coordination algorithms with discrete‐time communication
  publication-title: Automatica
– volume: 54
  start-page: 48
  issue: 1
  year: 2009
  end-page: 61
  article-title: Distributed subgradient methods for multiagent optimization
  publication-title: IEEE Trans Autom Control
– volume: 63
  start-page: 601
  issue: 3
  year: 2015
  end-page: 615
  article-title: Distributed optimization over time‐varying directed graphs
  publication-title: IEEE Trans Autom Control
– volume: 129
  start-page: 255
  issue: 2
  year: 2011
  end-page: 284
  article-title: Distributed multi‐agent optimization with state‐dependent communication
  publication-title: Math Progr
– volume: 63
  start-page: 1686
  issue: 6
  year: 2018
  end-page: 1693
  article-title: Constrained consensus in continuous‐time multiagent systems under weighted graph
  publication-title: IEEE Trans Autom Control
– volume: 50
  start-page: 15319
  issue: 1
  year: 2017
  end-page: 15324
  article-title: Distributed event‐triggered subgradient method for convex optimization with a common constraint
  publication-title: Sci Direct
– year: 2015
– volume: 65
  start-page: 90
  year: 2016
  end-page: 97
  article-title: Event‐triggered zero‐gradient‐sum distributed consensus optimization over directed networks
  publication-title: Automatica
– ident: e_1_2_7_12_1
  doi: 10.1109/ALLERTON.2010.5706956
– ident: e_1_2_7_15_1
  doi: 10.1007/s10107-011-0467-x
– ident: e_1_2_7_27_1
  doi: 10.1016/j.jfranklin.2020.03.035
– ident: e_1_2_7_21_1
  doi: 10.1109/TNNLS.2017.2651402
– ident: e_1_2_7_6_1
  doi: 10.1016/j.automatica.2017.09.016
– ident: e_1_2_7_33_1
  doi: 10.1109/TNNLS.2016.2549566
– ident: e_1_2_7_28_1
  doi: 10.1109/TAC.2015.2416927
– ident: e_1_2_7_14_1
  doi: 10.1109/TAC.2010.2041686
– ident: e_1_2_7_2_1
  doi: 10.1109/TNNLS.2017.2652478
– ident: e_1_2_7_3_1
  doi: 10.1016/j.automatica.2016.07.005
– ident: e_1_2_7_7_1
  doi: 10.1109/TAC.2017.2688452
– ident: e_1_2_7_30_1
  doi: 10.1109/TAC.2011.2167817
– ident: e_1_2_7_32_1
  doi: 10.1109/TAC.2016.2610945
– ident: e_1_2_7_40_1
  doi: 10.1016/j.automatica.2015.03.001
– ident: e_1_2_7_10_1
  doi: 10.1109/TCYB.2018.2828118
– ident: e_1_2_7_25_1
  doi: 10.1109/TAC.2017.2763782
– volume: 8
  start-page: 2169
  year: 2020
  ident: e_1_2_7_26_1
  article-title: Distributed event‐triggered subgradient method for convex optimization with general step‐size
  publication-title: IEEE Access
– ident: e_1_2_7_31_1
  doi: 10.1109/TAC.2018.2852602
– volume: 2017
  start-page: 1
  year: 2017
  ident: e_1_2_7_37_1
  article-title: Event‐triggered discrete‐time distributed consensus optimization over time‐varying graphs
  publication-title: Complexity
  doi: 10.1155/2017/5385708
– ident: e_1_2_7_36_1
  doi: 10.1109/TAC.2018.2800760
– ident: e_1_2_7_24_1
  doi: 10.1109/CDC.2015.7402401
– ident: e_1_2_7_38_1
  doi: 10.1109/TAC.2012.2184199
– ident: e_1_2_7_9_1
  doi: 10.1016/j.automatica.2017.07.064
– ident: e_1_2_7_34_1
  doi: 10.1109/CDC.2014.7039553
– ident: e_1_2_7_17_1
  doi: 10.1016/j.automatica.2015.11.014
– ident: e_1_2_7_18_1
  doi: 10.1109/TAC.2013.2278132
– ident: e_1_2_7_19_1
  doi: 10.1007/BF02869513
– volume: 50
  start-page: 15319
  issue: 1
  year: 2017
  ident: e_1_2_7_35_1
  article-title: Distributed event‐triggered subgradient method for convex optimization with a common constraint
  publication-title: Sci Direct
– ident: e_1_2_7_5_1
  doi: 10.1016/j.automatica.2016.06.004
– ident: e_1_2_7_41_1
  doi: 10.1016/S0167-6911(99)00070-5
– ident: e_1_2_7_13_1
  doi: 10.1109/TAC.2008.2009515
– ident: e_1_2_7_22_1
  doi: 10.1109/TCSII.2018.2811803
– ident: e_1_2_7_29_1
  doi: 10.1109/TAC.2017.2755374
– ident: e_1_2_7_20_1
  doi: 10.1109/TAC.2007.895885
– ident: e_1_2_7_23_1
  doi: 10.1109/TAC.2014.2364096
– ident: e_1_2_7_8_1
  doi: 10.1109/CDC.2012.6426136
– ident: e_1_2_7_11_1
  doi: 10.1002/rnc.4462
– ident: e_1_2_7_16_1
  doi: 10.1109/TSMC.2016.2531649
– ident: e_1_2_7_4_1
  doi: 10.1109/CDC.2014.7039537
– ident: e_1_2_7_39_1
  doi: 10.1016/j.automatica.2015.11.015
SSID ssj0007132
Score 2.298448
Snippet Summary In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded...
In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint,...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 526
SubjectTerms Algorithms
distributed algorithm
event‐triggered
general constraint
general Nash equilibrium
general step‐size
Search algorithms
Title Event‐triggered distributed algorithm for searching general Nash equilibrium with general step‐size
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Foca.2688
https://www.proquest.com/docview/2494705678
Volume 42
WOSCitedRecordID wos000580456400001&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: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1099-1514
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007132
  issn: 0143-2087
  databaseCode: DRFUL
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1PS8MwFA-6edCD_8XplAiip7o2bZfkOOaGB5kiDnYrbZJ2ha2b6-bBkx_Bz-gn8aXt_ggKgqcWkpTy8vLe7yUvv4fQpQgDQAW2Y3DK6wZYv7rB9UVgSzk8NJVtuVRkxSZop8N6Pf5YZFXquzA5P8Riw02vjMxe6wXuB2ltSRoKpv6G1BlbR2UCauuWUPn2qd29X9hhCL9InsBogy4wOqeeNUltPva7M1oizFWcmjma9s5_fnEXbRfwEjdyfdhDayrZR1srpIMHKGrpFMfP948pBOaRLtWJpWbP1YWv4N0fRKNJPO0PMcBZXJw0JBGOcn5q3PHTPlYvszi7LDAbYr2Tu2gFnRnDp9P4TR2ibrv13LwzinILhgCfzwzBRcBNaUGAA05ccjeE6MYWIXGY6UtXOa5pisCEkFZxElBfBtJyFUhZCuIoattHqJSMEnWMcOCaKqwLGYZSOjZ4POGzkCkC4JAJId0Kup7L3RMFF7kuiTHwchZl4oHoPC26CrpY9Bzn_Bs_9KnOp84rVmDqQVjpUEB3FJqvskn6dbz30Gzo58lfO56iTaJTW7JUtCoqTSczdYY2xOs0TifnhR5-AfO_5J4
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB5qK6gH32J9RhA9rW6zu90ET1JbKtYqYqG3ZTfJroW2ah8ePPkT_I3-Eif7aBUUBE-7kGRZJpOZb5LJNwCHIgwQFVi2wV1eNtD6lQ2uLwKXlM1DU1klxxVxsQm32WTtNr_NwVl2Fybhh5hsuOmVEdtrvcD1hvTplDUUbf0JLTM2AwUbtQjVu3BxV2s1JoYY4y-aZDBaqAzMzbhnTXqajf3ujaYQ8ytQjT1Nbelf_7gMiynAJOeJRqxATvVXYeEL7eAaRFWd5Pjx9j7C0DzSxTqJ1Py5uvQVvvvd6HHQGT30CAJakp419CMSJQzVpOkPH4h6Hnfi6wLjHtF7uZNW1Jon_PSw86rWoVWr3lfqRlpwwRDo9ZkhuAi4KUsY4qAbl9wJMb6xREhtZvrSUbZjmiIwMahVnAauLwNZchSKWQpqK9eyNiDff-yrTSCBY6qwLGQYSmlb6POEz0KmKMJDJoR0inCcCd4TKRu5LorR9RIeZeqh6DwtuiIcTHo-JQwcP_TZyebOS9fg0MPA0nYR37nYfBTP0q_jvZvKuX5u_bXjPszV768bXuOyebUN81QnusSJaTuQHw3GahdmxcuoMxzspUr5CZqj6I4
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50FdGDb3F11Qiip2o3bbcJnhZ1UVxWEQVvpc2jLuzLfXjw5E_wN_pLnPSxq6AgeGohSSmTycw3yeQbgAOhI0QFjmtxn1cstH4Vi5uLwGXlcm0rp-z5Iik24Tca7PGR307BaX4XJuWHGG-4mZWR2GuzwFVP6pMJayja-mNaYWwaZlxTQ6YAM-d3tYf62BBj_EXTDEYHlYH5OfesTU_ysd-90QRifgWqiaepLf3rH5dhMQOYpJpqxApMqc4qLHyhHVyD-MIkOX68vQ8xNI9NsU4iDX-uKX2F72Er7vabw6c2QUBLsrOGTkzilKGaNMLBE1HPo2ZyXWDUJmYvd9yKWtPDTw-ar2odHmoX92eXVlZwwRLo9ZkluIi4LcsY4qAbl9zTGN84QlOX2aH0lOvZtohsDGoVp5EfykiWPYViloK6ynecDSh0uh21CSTybKUrQmotpeugzxMh00xRhIdMCOkV4SgXfCAyNnJTFKMVpDzKNEDRBUZ0Rdgf9-ylDBw_9Cnlcxdka3AQYGDp-ojvfGw-TGbp1_HBzVnVPLf-2nEP5m7Pa0H9qnG9DfPU5LkkeWklKAz7I7UDs-Jl2Bz0dzOd_ARJ_ugJ
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=Event%E2%80%90triggered+distributed+algorithm+for+searching+general+Nash+equilibrium+with+general+step%E2%80%90size&rft.jtitle=Optimal+control+applications+%26+methods&rft.au=Li%2C+Ran&rft.au=Mu%2C+Xiaowu&rft.date=2021-03-01&rft.pub=Wiley+Subscription+Services%2C+Inc&rft.issn=0143-2087&rft.eissn=1099-1514&rft.volume=42&rft.issue=2&rft.spage=526&rft.epage=547&rft_id=info:doi/10.1002%2Foca.2688&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0143-2087&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0143-2087&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0143-2087&client=summon