Conformity-Driven Agents Support Ordered Phases in the Spatial Public Goods Game

We investigate the spatial Public Goods Game in the presence of fitness-driven and conformity-driven agents. This framework usually considers only the former type of agents, i.e., agents that tend to imitate the strategy of their fittest neighbors. However, whenever we study social systems, the evolution of a population might be affected also by social behaviors as conformism, stubbornness, altruism, and selfishness. Although the term evolution can assume different meanings depending on the considered domain, here it corresponds to the set of processes that lead a system towards an equilibrium or a steady-state. We map fitness to the agents' payoff so that richer agents are those most imitated by fitness-driven agents, while conformity-driven agents tend to imitate the strategy assumed by the majority of their neighbors. Numerical simulations aim to identify the nature of the transition, on varying the amount of the relative density of conformity-driven agents in the population, and to study the nature of related equilibria. Remarkably, we find that conformism generally fosters ordered cooperative phases and may also lead to bistable behaviors.Comment: 13 pages, 5 figure

Supercooperation in Evolutionary Games on Correlated Weighted Networks

In this work we study the behavior of classical two-person, two-strategies evolutionary games on a class of weighted networks derived from Barab\'asi-Albert and random scale-free unweighted graphs. Using customary imitative dynamics, our numerical simulation results show that the presence of link weights that are correlated in a particular manner with the degree of the link endpoints, leads to unprecedented levels of cooperation in the whole games' phase space, well above those found for the corresponding unweighted complex networks. We provide intuitive explanations for this favorable behavior by transforming the weighted networks into unweighted ones with particular topological properties. The resulting structures help to understand why cooperation can thrive and also give ideas as to how such supercooperative networks might be built.Comment: 21 page

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

Emergence of communities and diversity in social networks

Communities are common in complex networks and play a significant role in the functioning of social, biological, economic, and technological systems. Despite widespread interest in detecting community structures in complex networks and exploring the effect of communities on collective dynamics, a deep understanding of the emergence and prevalence of communities in social networks is still lacking. Addressing this fundamental problem is of paramount importance in understanding, predicting, and controlling a variety of collective behaviors in society. An elusive question is how communities with common internal properties arise in social networks with great individual diversity. Here, we answer this question using the ultimatum game, which has been a paradigm for characterizing altruism and fairness. We experimentally show that stable local communities with different internal agreements emerge spontaneously and induce social diversity into networks, which is in sharp contrast to populations with random interactions. Diverse communities and social norms come from the interaction between responders with inherent heterogeneous demands and rational proposers via local connections, where the former eventually become the community leaders. This result indicates that networks are significant in the emergence and stabilization of communities and social diversity. Our experimental results also provide valuable information about strategies for developing network models and theories of evolutionary games and social dynamics.This work was supported by the National Nature Science Foundation of China under Grants 61573064, 71631002, 71401037, and 11301032; the Fundamental Research Funds for the Central Universities and Beijing Nova Programme; and the Natural Sciences and Engineering Research Council of Canada (Individual Discovery Grant). The Boston University work was supported by NSF Grants PHY-1505000, CMMI-1125290, and CHE- 1213217, and by Defense Threat Reduction Agency Grant HDTRA1-14-1-0017, and Department of Energy Contract DE-AC07-05Id14517. (61573064 - National Nature Science Foundation of China; 71631002 - National Nature Science Foundation of China; 71401037 - National Nature Science Foundation of China; 11301032 - National Nature Science Foundation of China; Fundamental Research Funds for the Central Universities and Beijing Nova Programme; Natural Sciences and Engineering Research Council of Canada (Individual Discovery Grant); PHY-1505000 - NSF; CMMI-1125290 - NSF; CHE-1213217 - NSF; HDTRA1-14-1-0017 - Defense Threat Reduction Agency; DE-AC07-05Id14517 - Department of Energy)Published versio

Evolutionary games on multilayer networks: A colloquium

Networks form the backbone of many complex systems, ranging from the Internet to human societies. Accordingly, not only is the range of our interactions limited and thus best described and modeled by networks, it is also a fact that the networks that are an integral part of such models are often interdependent or even interconnected. Networks of networks or multilayer networks are therefore a more apt description of social systems. This colloquium is devoted to evolutionary games on multilayer networks, and in particular to the evolution of cooperation as one of the main pillars of modern human societies. We first give an overview of the most significant conceptual differences between single-layer and multilayer networks, and we provide basic definitions and a classification of the most commonly used terms. Subsequently, we review fascinating and counterintuitive evolutionary outcomes that emerge due to different types of interdependencies between otherwise independent populations. The focus is on coupling through the utilities of players, through the flow of information, as well as through the popularity of different strategies on different network layers. The colloquium highlights the importance of pattern formation and collective behavior for the promotion of cooperation under adverse conditions, as well as the synergies between network science and evolutionary game theory.Comment: 14 two-column pages, 8 figures; accepted for publication in European Physical Journal

Leaders should not be conformists in evolutionary social dilemmas

The most common assumption in evolutionary game theory is that players should adopt a strategy that warrants the highest payoff. However, recent studies indicate that the spatial selection for cooperation is enhanced if an appropriate fraction of the population chooses the most common rather than the most profitable strategy within the interaction range. Such conformity might be due to herding instincts or crowd behavior in humans and social animals. In a heterogeneous population where individuals differ in their degree, collective influence, or other traits, an unanswered question remains who should conform. Selecting conformists randomly is the simplest choice, but it is neither a realistic nor the optimal one. We show that, regardless of the source of heterogeneity and game parametrization, socially the most favorable outcomes emerge if the masses conform. On the other hand, forcing leaders to conform significantly hinders the constructive interplay between heterogeneity and coordination, leading to evolutionary outcomes that are worse still than if conformists were chosen randomly. We conclude that leaders must be able to create a following for network reciprocity to be optimally augmented by conformity. In the opposite case, when leaders are castrated and made to follow, the failure of coordination impairs the evolution of cooperation.Comment: 7 two-column pages, 4 figures; accepted for publication in Scientific Reports [related work available at arXiv:1412.4113

Two Species Evolutionary Game Model of User and Moderator Dynamics

We construct a two species evolutionary game model of an online society consisting of ordinary users and behavior enforcers (moderators). Among themselves, moderators play a coordination game choosing between being "positive" or "negative" (or harsh) while ordinary users play prisoner's dilemma. When interacting, moderators motivate good behavior (cooperation) among the users through punitive actions while the moderators themselves are encouraged or discouraged in their strategic choice by these interactions. We show the following results: (i) We show that the $\omega$-limit set of the proposed system is sensitive both to the degree of punishment and the proportion of moderators in closed form. (ii) We demonstrate that the basin of attraction for the Pareto optimal strategy $(\text{Cooperate},\text{Positive})$ can be computed exactly. (iii) We demonstrate that for certain initial conditions the system is self-regulating. These results partially explain the stability of many online users communities such as Reddit. We illustrate our results with examples from this online system.Comment: 8 pages, 4 figures, submitted to 2012 ASE Conference on Social Informatic

Hawks and Doves on Small-World Networks

We explore the Hawk-Dove game on networks with topologies ranging from regular lattices to random graphs with small-world networks in between. This is done by means of computer simulations using several update rules for the population evolutionary dynamics. We find the overall result that cooperation is sometimes inhibited and sometimes enhanced in those network structures, with respect to the mixing population case. The differences are due to different update rules and depend on the gain-to-cost ratio. We analyse and qualitatively explain this behavior by using local topological arguments.Comment: 12 pages, 8 figure