A minimal information prisoner's dilemma on evolving networks

L. Luthi, M. Giacobini, M. Tomassini
In: L.M. Rocha, L.S. Yaeger, M.A. Bedau, D. Floreano, R.L. Goldstone, A. Vespignani (Eds.):
AlifeX, Proceedings of the Tenth International Conference on the Simulation and Synthesis of Living Systems., MIT Press, Boston, 438 - 444, 2006.

We study by computer simulation a group of individuals playing the prisoner’s dilemma game with minimal information of their environment. The network of relationships between players, and their strategy can change over time following simple rules based on players’ degree of satisfaction and despair. We investigated both synchronous and asynchronous network dynamics, observing that cooperation can emerge and remain stable for a range of the parameters. In these regions the network self-organizes such that cooperators form highly connected clusters. Outside this parameter range cooperation drops and the network becomes more random.

Materials on this page may be the property of the authors and/or journals named.