Abstract :
The self-organization in cooperative regimes in a simple mean-field version of a model based on “selfish” agents which play the Prisonerʹs Dilemma (PD) game is studied. The agents have no memory and use strategies not based on direct reciprocity nor “tags”. Two variables are assigned to each agent k at time t, measuring its capital C(k;t) and its probability of cooperation p(k;t). At each time step t a pair of agents interact by playing the PD game. These two agents update their probability of cooperation p(k;t) as follows: they compare the profits they made in this interaction δC(k;t) with an estimator (k;t) and, if δC(k;t) (k;t), agent i increases its p(k;t) while if δC(k;t)< (k;t) the agent decreases p(k;t). The 4!=24 different cases produced by permuting the four Prisonerʹs Dilemma canonical payoffs 3, 0, 1, and 5—corresponding, respectively, to R (reward), S (suckerʹs payoff), T (temptation to defect) and P (punishment)—are analyzed. It turns out that for all these 24 possibilities, after a transient, the system self-organizes into a stationary state with average equilibrium probability of cooperation . Depending on the payoff matrix, there are different equilibrium states characterized by their average probability of cooperation and average equilibrium per capita income .
