Emergent Spatial Characteristics from Strategic Games Simulated on Random and Real Networks

Author name not available (Why is that?)

Publication date: 27 August 2022

Abstract: 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.

Has companion code repository: https://github.com/for-inspiration-and-recognition-of-math/m168-simulation

This page was built for publication: Emergent Spatial Characteristics from Strategic Games Simulated on Random and Real Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409016)