Papers › Emergent Spatial Characteristics from Strategic Games Simulated on Random and Real Networks
Emergent Spatial Characteristics from Strategic Games Simulated on Random and Real Networks
Louis Zhao, Chen Ye Gan, Minglu Zhao
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network structure should have an impact on the progression of the game. By defining each interaction in terms of a prisoner's dilemma and using its payoff matrix as a basis for investigation, we implemented players with various interaction and edge attachment strategies, and ran this dynamic process on real and random networks with varying network structure. We found that, both network size and small world properties played an important role in not only deciding the convergence rate of the simulation but also the dominant status of nodes, under the conditions where identical strategies are employed by every player.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections