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!
Beschreibung
Zusammenfassung: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.
Bibliographie:Funding information
National Natural Science Foundation of China, 11971444
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0143-2087
1099-1514
DOI:10.1002/oca.2688