Extended Pair Approximation of Evolutionary Game on Complex Networks
Satoru Morita

TL;DR
This paper extends the pair approximation method to analyze how degree fluctuation and clustering in complex networks affect evolutionary game dynamics, revealing that higher degree fluctuation increases player mobility and higher clustering reduces the number of neighbors.
Contribution
The paper introduces an extended pair approximation method that accounts for degree fluctuation and clustering in complex networks for evolutionary games.
Findings
Higher degree fluctuation increases player mobility.
Higher clustering coefficient reduces the number of neighbors.
Network structure significantly influences evolutionary game outcomes.
Abstract
We investigate how network structure influences evolutionary games on networks. We extend the pair approximation to study the effects of degree fluctuation and clustering of the network. We find that a larger fluctuation of the degree is equivalent to a larger mobility of the players. In addition, a larger clustering coefficient is equivalent to a smaller number of neighbors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
