Social games in a social network

Abstract

We study an evolutionary version of the Prisoner's Dilemma game, played by agents placed in a small-world network. Agents are able to change their strategy, imitating that of the most successful neighbor. We observe that different topologies, ranging from regular lattices to random graphs, produce a variety of emergent behaviors. This is a contribution towards the study of social phenomena and transitions governed by the topology of the community.