Network Growth via Preferential Attachment based on Prisoner's Dilemma Game

TL;DR

This paper introduces a network growth model driven by Prisoner's Dilemma game outcomes, where new nodes preferentially attach based on players' profits, revealing phase transitions and degree distribution properties through simulations and theory.

Contribution

It presents a novel network growth mechanism based on game-theoretic profits, combining simulation and theoretical analysis to study emergent network properties.

Findings

Network exhibits power-law degree distribution.

Strategy distribution shows phase transition behavior.

Theoretical results align with simulation outcomes.

Abstract

In this article we discuss network growth based on Prisoner's Dilemma(PD) where palyers on nodes in a network palay with its linked players. The players estimate total profits in the PD. When a new node is attached, the node make linkes to nodes in the network with the probabilities in proportion to the profits made by the game. Iterating this process, a network grows. We investigate properties of this type of growing networks, especially the degree distribution and time-depending strategy distribution by running computer simulation. We also find a sort of phase transition in the strategy distributions. For these phenomena given by computer simulation, theoretical studies are also carried out.