Cellular Automaton Spatial
Prisoner's Dilemma:
Cellular Automaton Spatial
Prisoner's Dilemma:
These simulators are instances of Cellular Automata. Cellular automata have been used to introduce spatiality into the models of the evolution of cooperation. Proponents consdier them a sort of "zero-case" model of decision making, in that agents are spatially located, but (normally) cannot move.
The interesting things to do with this seem to be play with neighborhood size (code "nhd:") and payoffs. Both versions start with Hegselmann's ((8,0),(10,1)) PD payoffs. More familiar payoffs make things dicier for cooperation.
Hegselmann's "lineland" version is a single ring of cells, but the simulator draws them in sequence forming a grid.
The other thing is that if you stop the simulator, you can reverse a cell's move by clicking on it. (In lineland, clicking on a column modifies the active cell.) Random resets tend to go to "all defect" with neighborhoods bigger than 1. But you will see that if you create a little enclave of cooperators, it can spread and cooperation can become "dynamically stable".
Try hitting the Code List link on the left panel in order to get help with controlling the simulator.