Emerging Cooperation in N-Person Iterated Prisoner's Dilemma over Dynamic Complex Networks

The N-Person Iterated Prisoner's Dilemma (NIPD) is an interesting game that has proved to be very useful to explore the emergence of cooperation in multi-player scenarios. Within this game, the way that agents are interconnected is a key element that influences cooperation. In this context, complex networks provide a realistic model of the topological features found in Nature and in many social and technological networks. Considering these networks, it is interesting to study the network evolution, given the possibility that agents can change their neighbors (dynamic rewire), when non-cooperative behaviors are detected. In this paper, we present a model of the NIPD game where a population of genetically-coded agents compete altogether. We analyze how different game parameters, and the network topology, affect the emergence of cooperation in static complex networks. Based on that, we present the main contribution of the paper that concerns the influence of dynamic rewiring in the emergence of cooperation over the NIPD

On the effect of memory on the Prisoner's Dilemma game in correlated networks

Game theory is fundamental to understanding cooperation between agents. Mainly, the Prisoner's Dilemma is a well-known model that has been extensively studied in complex networks. However, although the emergence of cooperation has been investigated before, the influence of memory in its evolution is not well understood. This paper presents a detailed study of cooperation dynamics in which agents have memory. We simulate the evolutionary Prisoner's dilemma game on random, scale-free and networks presenting degree-degree correlation. Through extensive simulations, we show that assortativity can improve cooperation when the temptation to defect increases. Moreover, we show that the inclusion of memory decreases the network structure influence. Our results contribute to understanding the role of the network structure and the player's memory of cooperation

Co-evolution of strategies and update rules in the prisoner's dilemma game on complex networks

In this paper, we study a weak prisoner’s dilemma (PD) game in which both strategies and update rules are subjected to evolutionary pressure. Interactions among agents are specified by complex topologies, and we consider both homogeneous and heterogeneous situations. We consider deterministic and stochastic update rules for the strategies, which in turn may consider single links or the full context when selecting agents to copy from. Our results indicate that the co-evolutionary process preserves heterogeneous networks as a suitable framework for the emergence of cooperation. Furthermore, on those networks the update rule leading to a larger fraction, which we call replicator dynamics, is selected during co-evolution. On homogeneous networks, we observe that even if the replicator dynamics again turns out to be the selected update rule, the cooperation level is greater than on a fixed update rule framework. We conclude that for a variety of topologies, the fact that the dynamics co-evolves with the strategies leads, in general, to more cooperation in the weak PD game.Publicad

Preferential opponent selection in public goods games

This paper discusses preferential opponent selection in public goods games. It is shown that a preference to play with successful opponents strongly enhances the prevalence of cooperation. The finding is robust on spatial grids and heterogeneous networks. Importantly, I also demonstrate that positive opponent selection biases can evolve and become dominant in initially randomly mixed populations without selection bias

Ageing as a price of cooperation and complexity: Self-organization of complex systems causes the ageing of constituent networks

The analysis of network topology and dynamics is increasingly used for the description of the structure, function and evolution of complex systems. Here we summarize key aspects of the evolvability and robustness of the hierarchical network-set of macromolecules, cells, organisms, and ecosystems. Listing the costs and benefits of cooperation as a necessary behaviour to build this network hierarchy, we outline the major hypothesis of the paper: the emergence of hierarchical complexity needs cooperation leading to the ageing of the constituent networks. Local cooperation in a stable environment may lead to over-optimization developing an ‘always-old’ network, which ages slowly, and dies in an apoptosis-like process. Global cooperation by exploring a rapidly changing environment may cause an occasional over-perturbation exhausting system-resources, causing rapid degradation, ageing and death of an otherwise ‘forever-young’ network in a necrosis-like process. Giving a number of examples we explain how local and global cooperation can both evoke and help successful ageing. Finally, we show how various forms of cooperation and consequent ageing emerge as key elements in all major steps of evolution from the formation of protocells to the establishment of the globalized, modern human society. Thus, ageing emerges as a price of complexity, which is going hand-in-hand with cooperation enhancing each other in a successful community