arXiv subjects
Publications and source records attributed to E. Pestelacci.
We simulate the prisoner's dilemma and hawk-dove games on a real social acquaintance network. Using a discrete analogue of replicator dynamics, we show that surprisingly high levels of cooperation can be achieved, contrary to what happens in unstructured mixing populations. Moreover, we empirically show that cooperation in this network is stable with respect to invasion by defectors.
In this paper we extend the investigation of cooperation in some classical evolutionary games on populations were the network of interactions among individuals is of the scale-free type. We show that the update rule, the payoff computation and, to some extent the timing of the operations, have a marked influence on the transient dynamics and on the amount of cooperation that can be established at equilibrium. We also study the dynamical behavior of the populations and their evolutionary stability.