Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/330124 
Erscheinungsjahr: 
2025
Quellenangabe: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 16 [Issue:] 1 [Article No.:] 10 [Year:] 2025 [Pages:] 1-14
Verlag: 
MDPI, Basel
Zusammenfassung: 
The computational complexity of large-scale networked evolutionary games has become a challenging problem. Based on network aggregation and pinning control methods, this paper investigates the problem of control design for strategy consensus of large-scale networked evolutionary games. The large-size network is divided into several small subnetworks by the aggregation method, and a pinning control algorithm is proposed to achieve the strategy consensus of small subnetworks. Then, the matchable condition between the small subnetworks is realized by the input-output control. Finally, some sufficient conditions as well as an algorithm are proposed for the strategy consensus of large-scale networked evolutionary games.
Schlagwörter: 
networked evolutionary games
network aggregation
pinning control
strategy consensus
semi-tensor product of matrices
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article
Erscheint in der Sammlung:

Datei(en):
Datei
Größe
813.81 kB





Publikationen in EconStor sind urheberrechtlich geschützt.