Stability of networked evolutionary games with asynchronous strategy updating rules and different memory lengths

Haonan Li, Pengfei Yan, Fukun Liu and Hao Zhang

Chaos, Solitons & Fractals, 2025, vol. 199, issue P1

Abstract: This study explores the stability of Networked Evolutionary Games subjected to asynchronous strategy updating rules and different memory lengths. Specifically, in order to incorporate the players’ memory, we develop an augmented logical form of the model employing the semi-tensor product of matrices. Then, the model’s stability is analyzed, yielding two criteria for determining stability under diverse strategy updating schemes. It is found that both the fixed points and the strategy updating schemes are critical to the convergence of the game. Based on that, an algorithm is designed to generate optimal scheme control sequences, ensuring the game’s stability. Under these control sequences, the transient time of the game is significantly reduced. Finally, two examples elucidate the aforementioned theoretical results.

Keywords: Stability; Networked evolutionary games; Semi-tensor product of matrices; Asynchronous strategy updating rules; Different memory lengths (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007792500668X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:199:y:2025:i:p1:s096007792500668x

DOI: 10.1016/j.chaos.2025.116655

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().