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.
A Minimal Information Prisoner’s Dilemma on Evolving Networks
GIACOBINI, Mario Dante Lucio;
2006-01-01
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
