View source for The evolution of cooperation in a fixed-rule network

Back to [[Games and networks]]

We'll start building the model in Java/Repast, and see how cooperative behavior fares in a population of individuals with a fixed rule for building connections with others.

We start with a random graph (or some other initial condition.)

At each time step,
# each individual plays against everyone he is connected to, and gets payoff according to the sum of all these interactions
# one individual, chosen proportional to fitness, will produce one offspring
# this offspring is connected to the parent and to all the parent's neighbors (or some other fixed rule)
# a random node is chosen to die (to keep population size fixed), and
# all individuals' fitness is reset to 0.