Signed Networks, Triadic Interactions and the Evolution of Cooperation
This addresses the problem of understanding cooperation dynamics in social networks for researchers in evolutionary game theory and network science, representing an incremental advance by extending models to include triadic interactions.
The paper tackles the evolution of cooperation in signed networks using a prisoner's dilemma model, finding that cooperation fails with dyadic interactions but emerges as stable behavior when triadic considerations are introduced.
We outline a model to study the evolution of cooperation in a population of agents playing the prisoner's dilemma in signed networks. We highlight that if only dyadic interactions are taken into account, cooperation never evolves. However, when triadic considerations are introduced, a window of opportunity for emergence of cooperation as a stable behaviour emerges.