Attractors and basins of cascading networked evolutionary game under generalized asynchronous update

Ruichen Sun, Hao Zhang, Chengye Zou, Chuan Zhang and Zhengqi Liu

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

Abstract: Methods for finding the attractors and determining their basins in generalized asynchronous networked evolutionary games (GANEGs) and generalized asynchronous cascading networked evolutionary games (GACNEGs) are studied in this paper. Specifically, first, we model the NEGs and the CNEGs, and then linearize them into algebraic forms. Secondly, the algebraic forms of the GANEGs and the GACNEGs are derived. Then, this work defines the table of profile transitions in an asynchronous game and propose two theorems that search for the fixed points and attractors in the GANEGs and the GANEGs. Additionally, algorithm for finding attractors and their basins is provided. Finally, two examples clarify the previously mentioned theoretical findings about searching for attractors and basins.

Keywords: Networked evolutionary games; Semi-tensor product of matrices; Cascading; Attractor and basin; Generalized asynchronous (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007792501015X
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:200:y:2025:i:p1:s096007792501015x

DOI: 10.1016/j.chaos.2025.117002

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. ().