Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330124 
Year of Publication: 
2025
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 16 [Issue:] 1 [Article No.:] 10 [Year:] 2025 [Pages:] 1-14
Publisher: 
MDPI, Basel
Abstract: 
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.
Subjects: 
networked evolutionary games
network aggregation
pinning control
strategy consensus
semi-tensor product of matrices
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.