Prisoner's Dilemma on Graphs with Large Girth

Details Prisoner's Dilemma on Graphs with Large Girth Prisoner's Dilemma on Graphs with Large Girth

2011-02-04

arxiv.org/abs/1102.1038v1

Computer Science

Social and Information Networks

10 pages, 1 figure

Scientific paper

We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether to cooperate or defect in a repeated game. The players revise their actions by imitating those neighbors who have higher payoffs. We show that when the interactions take place on graphs with large girth, cooperation is more likely to emerge. On the flip side, in graphs with many cycles of length 3 and 4, defection spreads more rapidly. One of the key ideas of our analysis is that our dynamics can be seen as a perturbation of the voter model. We write the transition kernel of the corresponding Markov chain in terms of the pairwise correlations in the voter model. We analyze the pairwise correlation and show that in graphs with relatively large girth, cooperators cluster and help each other.

Affiliated with

Also associated with

No associations

Rating

Prisoner's Dilemma on Graphs with Large Girth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prisoner's Dilemma on Graphs with Large Girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prisoner's Dilemma on Graphs with Large Girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52466