Cooperation in the snowdrift game on directed small-world networks under self-questioning and noisy conditions

Cooperation in the evolutionary snowdrift game with a self-questioning updating mechanism is studied on annealed and quenched small-world networks with directed couplings. Around the payoff parameter value $r=0.5$, we find a size-invariant symmetrical cooperation effect. While generally suppressing cooperation for $r>0.5$ payoffs, rewired networks facilitated cooperative behavior for $r<0.5$. Fair amounts of noise were found to break the observed symmetry and further weaken cooperation at relatively large values of $r$. However, in the absence of noise, the self-questioning mechanism recovers symmetrical behavior and elevates altruism even under large-reward conditions. Our results suggest that an updating mechanism of this type is necessary to stabilize cooperation in a spatially structured environment which is otherwise detrimental to cooperative behavior, especially at high cost-to-benefit ratios. Additionally, we employ component and local stability analyses to better understand the nature of the manifested dynamics.Comment: 7 pages, 6 figures, 1 tabl

Evolutionary game theory: Temporal and spatial effects beyond replicator dynamics

Evolutionary game dynamics is one of the most fruitful frameworks for studying evolution in different disciplines, from Biology to Economics. Within this context, the approach of choice for many researchers is the so-called replicator equation, that describes mathematically the idea that those individuals performing better have more offspring and thus their frequency in the population grows. While very many interesting results have been obtained with this equation in the three decades elapsed since it was first proposed, it is important to realize the limits of its applicability. One particularly relevant issue in this respect is that of non-mean-field effects, that may arise from temporal fluctuations or from spatial correlations, both neglected in the replicator equation. This review discusses these temporal and spatial effects focusing on the non-trivial modifications they induce when compared to the outcome of replicator dynamics. Alongside this question, the hypothesis of linearity and its relation to the choice of the rule for strategy update is also analyzed. The discussion is presented in terms of the emergence of cooperation, as one of the current key problems in Biology and in other disciplines.Comment: Review, 48 pages, 26 figure

A generalized public goods game with coupling of individual ability and project benefit

Facing a heavy task, any single person can only make a limited contribution and team cooperation is needed. As one enjoys the benefit of the public goods, the potential benefits of the project are not always maximized and may be partly wasted. By incorporating individual ability and project benefit into the original public goods game, we study the coupling effect of the four parameters, the upper limit of individual contribution, the upper limit of individual benefit, the needed project cost and the upper limit of project benefit on the evolution of cooperation. Coevolving with the individual-level group size preferences, an increase in the upper limit of individual benefit promotes cooperation while an increase in the upper limit of individual contribution inhibits cooperation. The coupling of the upper limit of individual contribution and the needed project cost determines the critical point of the upper limit of project benefit, where the equilibrium frequency of cooperators reaches its highest level. Above the critical point, an increase in the upper limit of project benefit inhibits cooperation. The evolution of cooperation is closely related to the preferred group-size distribution. A functional relation between the frequency of cooperators and the dominant group size is found

Learning and innovative elements of strategy adoption rules expand cooperative network topologies

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoners Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.Comment: 14 pages, 3 Figures + a Supplementary Material with 25 pages, 3 Tables, 12 Figures and 116 reference

A Novel Clustering Algorithm Based on Quantum Games

Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points in a dataset are considered as players who can make decisions and implement quantum strategies in quantum games. After each round of a quantum game, each player's expected payoff is calculated. Later, he uses a link-removing-and-rewiring (LRR) function to change his neighbors and adjust the strength of links connecting to them in order to maximize his payoff. Further, algorithms are discussed and analyzed in two cases of strategies, two payoff matrixes and two LRR functions. Consequently, the simulation results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the clustering algorithms have fast rates of convergence. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.Comment: 19 pages, 5 figures, 5 table

Social diversity and promotion of cooperation in the spatial prisoner's dilemma game

The diversity in wealth and social status is present not only among humans, but throughout the animal world. We account for this observation by generating random variables that determ ine the social diversity of players engaging in the prisoner's dilemma game. Here the term social diversity is used to address extrinsic factors that determine the mapping of game pay offs to individual fitness. These factors may increase or decrease the fitness of a player depending on its location on the spatial grid. We consider different distributions of extrin sic factors that determine the social diversity of players, and find that the power-law distribution enables the best promotion of cooperation. The facilitation of the cooperative str ategy relies mostly on the inhomogeneous social state of players, resulting in the formation of cooperative clusters which are ruled by socially high-ranking players that are able to prevail against the defectors even when there is a large temptation to defect. To confirm this, we also study the impact of spatially correlated social diversity and find that coopera tion deteriorates as the spatial correlation length increases. Our results suggest that the distribution of wealth and social status might have played a crucial role by the evolution of cooperation amongst egoistic individuals.Comment: 5 two-column pages, 5 figure

Effect of spatial structure on the evolution of cooperation

16 pages, 14 figures.-- PACS nrs.: 89.65.−s, 87.23.Ge, 87.23.Kg, 02.50.Le.-- ArXiv pre-print available at: http://arxiv.org/abs/0806.1649Spatial structure is known to have an impact on the evolution of cooperation, and so it has been intensively studied during recent years. Previous work has shown the relevance of some features, such as the synchronicity of the updating, the clustering of the network, or the influence of the update rule. This has been done, however, for concrete settings with particular games, networks, and update rules, with the consequence that some contradictions have arisen and a general understanding of these topics is missing in the broader context of the space of 2×2 games. To address this issue, we have performed a systematic and exhaustive simulation in the different degrees of freedom of the problem. In some cases, we generalize previous knowledge to the broader context of our study and explain the apparent contradictions. In other cases, however, our conclusions refute what seems to be established opinions in the field, as for example the robustness of the effect of spatial structure against changes in the update rule, or offer new insights into the subject, e.g., the relation between the intensity of selection and the asymmetry between the effects on games with mixed equilibria.This work is partially supported by Ministerio de Educación y Ciencia (Spain) under Grants Ingenio-MATHEMATICA and MOSAICO, and by Comunidad de Madrid (Spain) under Grants SIMUMAT-CM and MOSSNOHO-CM.Publicad

Evolutionary games on graphs

Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first three sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fourth section surveys the topological complications implied by non-mean-field-type social network structures in general. The last three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.Comment: Review, final version, 133 pages, 65 figure

Approximating evolutionary dynamics on networks using a Neighbourhood Configuration model

Evolutionary dynamics have been traditionally studied on homogeneously mixed and infinitely large populations. However, real populations are usually finite and characterised by complex interactions among individuals. Recent studies have shown that the outcome of the evolutionary process might be significantly affected by the population structure. Although an analytic investigation of the process is possible when the contact structure of the population has a simple form, this is usually infeasible on complex structures and the use of various assumptions and approximations is necessary. In this paper, we adopt an approximation method which has been recently used for the modelling of infectious disease transmission, to model evolutionary game dynamics on complex networks. Comparisons of the predictions of the model constructed with the results of computer simulations reveal the effectiveness of the process and the improved accuracy that it provides when, for example, compared to well-known pair approximation methods. This modelling framework offers a flexible way to carry out a systematic analysis of evolutionary game dynamics on graphs and to establish the link between network topology and potential system behaviours. As an example, we investigate how the Hawk and Dove strategies in a Hawk-Dove game spread in a population represented by a random regular graph, a random graph and a scale-free network, and we examine the features of the graph which affect the evolution of the population in this particular game