Hello,
I am trying to replicate the results from this paper by Nowak and May (1992) http://ped.fas.harvard.edu/files/ped/files/nature92_0.pdf
However, in my code I find I need to have a random element and thus my results are stochastic. This is because of my interpretation of the following part of Nowak and May's model:
"At the start of the next generation, each lattice-site is occupied by the player with the highest score among the previous owner and the immediate neighbours"
Thus my question is, if there are 2 or more neighbours with the same highest payoff, but with different strategies, which one do I pick to occupy the lattice-site? Currently I pick at random.
I am also keen to see a very clear step by step description of their algorithm, so would appreciate it if anyone knew of a paper where this is described.
Many thanks,
Liz