Paper Info
Title
The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating.
Abstract
The Prisoner's Dilemma Process on a graph is an iterative process where each vertex, with a fixed strategy (cooperate or defect), plays the game with each of its neighbours. At the end of a round each vertex may change its strategy to that of its neighbour with the highest pay-off. Here we study the spread of cooperative and selfish behaviours on a toroidal grid, where each vertex is initially a cooperator with probability p. When vertices are permitted to change their strategies via a randomized asynchronous update scheme, we find that for some values of p the limiting ratio of cooperators may be modelled as a polynomial in p. Theoretical bounds for this ratio are confirmed via simulation.
Year
DOI
Venue
2016
10.1007/978-3-319-49787-7_13
ALGORITHMS AND MODELS FOR THE WEB GRAPH, WAW 2016
DocType
Volume
ISSN
Conference
10088
0302-9743
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Christopher Duffy100.34
Jeannette Janssen229532.23