Evolutionary dynamics on interdependent populations

Spontaneous symmetry breaking of cooperation between species

In mutualistic associations, two species cooperate by exchanging goods or services with members of another species for their mutual benefit. At the same time, competition for reproduction primarily continues with members of their own species. In intra-species interactions, the prisoner's dilemma is the leading mathematical metaphor to study the evolution of cooperation. Here we consider inter-species interactions in the spatial prisoner's dilemma, where members of each species reside on one lattice layer. Cooperators provide benefits to neighbouring members of the other species at a cost to themselves. Hence, interactions occur across layers but competition remains within layers. We show that rich and complex dynamics unfold when varying the cost-to-benefit ratio of cooperation, r. Four distinct dynamical domains emerge that are separated by critical phase transitions, each characterized by diverging fluctuations in the frequency of cooperation: (i) for large r cooperation is too costly and defection dominates; (ii) for lower r cooperators survive at equal frequencies in both species; (iii) lowering r further results in an intriguing, spontaneous symmetry breaking of cooperation between species with increasing asymmetry for decreasing r; (iv) finally, for small r, bursts of mutual defection appear that increase in size with decreasing r and eventually drive the populations into absorbing states. Typically, one species is cooperating and the other defecting and hence establish perfect asymmetry. Intriguingly and despite the symmetrical model set-up, natural selection can nevertheless favour the spontaneous emergence of asymmetric evolutionary outcomes where, on average, one species exploits the other in a dynamical equilibrium.

Impact of discrepant accumulations strategy on collective cooperation in multilayer networks

Understanding large-scale cooperation among related individuals has been one of the largest challenges. Since humans are in multiple social networks, the theoretical framework of multilayer networks is perfectly suited for studying this fascinating aspect of our biology. To that effect, we here study the cooperation in evolutionary game on interdependent networks. Importantly, a part of players are set to adopt Discrepant Accumulations Strategy. Players employing this mechanism not only use their payoffs in the multilayer network as the basis for the updating process as in previous experiments, but also take into account the similarities and differences in strategies across different layers. Monte Carlo simulations demonstrate that considering the similarities and differences in strategies across layers when calculating fitness can significantly enhance the cooperation level in the system. By examining the behavior of different pairing modes within cooperators and defectors, the equilibrium state can be attributed to the evolution of correlated pairing modes between interdependent networks. Our results provide a theoretical analysis of the group cooperation induced by the Discrepant Accumulations Strategy. And we also discuss potential implications of these findings for future human experiments concerning the cooperation on multilayer networks.

Prisoner's Dilemma Game with Cooperation-Defection Dominance Strategies on Correlational Multilayer Networks

As multilayer networks are widely applied in modern society, numerous studies have shown the impact of a multilayer network structure and the network nature on the proportion of cooperators in the network. In this paper, we use Barabási-Albert scale-free networks (BA) and Watts and Strogatz networks (WS) to build a multilayer network structure, and we propose a new strategy-updating rule called "cooperation-defection dominance", which can be likened to dominant and recessive traits in biogenetics. With the newly constructed multilayer network structure and the strategy-updating rules, based on the simulation results, we find that in the BA-BA network, the cooperation dominance strategy can make the networks with different rs show a cooperative trend, while the defection dominance strategy only has an obvious effect on the network cooperation with a larger r. When the BA network is connected to the WS network, we find that the effect of strategy on the proportion of cooperators in the network decreases, and the main influencing factor is the structure of the network. In the three-layer network, the cooperation dominance strategy has a greater impact on the BA network, and the proportion of the cooperators is enhanced more than under the natural evolution strategy, but the promotion effect is still smaller than that of the two-layer BA network because of the WS network. Under the defection dominance strategy, the WS layer appears different from the first two strategies, and we conclude through simulation that when the payoff parameter is at the middle level, its cooperator proportion will be suppressed, and we deduce that the proportion of cooperators and defectors, as well as the payoff, play an important role.

The Polarization of the Coupling Strength of Interdependent Networks Stimulates Cooperation

We introduce a mixed network coupling mechanism and study its effects on how cooperation evolves in interdependent networks. This mechanism allows some players (conservative-driven) to establish a fixed-strength coupling, while other players (radical-driven) adjust their coupling strength through the evolution of strategy. By means of numerical simulation, a hump-like relationship between the level of cooperation and conservative participant density is revealed. Interestingly, interspecies interactions stimulate polarization of the coupling strength of radical-driven players, promoting cooperation between two types of players. We thus demonstrate that a simple mixed network coupling mechanism substantially expands the scope of cooperation among structured populations.

Evolution of cooperation with joint liability

'Personal responsibility', one of the basic principles of social governance, requires one to be accountable for what one does. However, personal responsibility is far from the only norm ruling human interactions, especially in social and economic activities. In many collective communities such as among enterprise colleagues and family members, one's personal interests are often bound to others'-once one member breaks the rule, a group of people have to bear the punishment or sanction. Such a mechanism is termed 'joint liability'. Although many real-world cases have evidenced that joint liability can help to maintain collective collaboration, a deep and systematic theoretical analysis on how and when it promotes cooperation remains lacking. Here, we use evolutionary game theory to model an interacting system with joint liability, where one's losing credit could deteriorate the reputation of the whole group. We provide the analytical condition to predict when cooperation evolves and analytically prove that in the presence of punishment, being jointly liable greatly promotes cooperation. Our work stresses that joint liability is of great significance in promoting current economic prosperity.

Evolutionary dynamics of higher-order interactions in social networks

We live and cooperate in networks. However, links in networks only allow for pairwise interactions, thus making the framework suitable for dyadic games, but not for games that are played in larger groups. Here, we study the evolutionary dynamics of a public goods game in social systems with higher-order interactions. First, we show that the game on uniform hypergraphs corresponds to the replicator dynamics in the well-mixed limit, providing a formal theoretical foundation to study cooperation in networked groups. Second, we unveil how the presence of hubs and the coexistence of interactions in groups of different sizes affects the evolution of cooperation. Finally, we apply the proposed framework to extract the actual dependence of the synergy factor on the size of a group from real-world collaboration data in science and technology. Our work provides a way to implement informed actions to boost cooperation in social groups.

Infection spreading and recovery in a square lattice

We investigate spreading and recovery of disease in a square lattice, and, in particular, emphasize the role of the initial distribution of infected patches in the network on the progression of an endemic and initiation of a recovery process, if any, due to migration of both the susceptible and infected hosts. The disease starts in the lattice with three possible initial distribution patterns of infected and infection-free sites, viz., infected core patches (ICP), infected peripheral patches (IPP), and randomly distributed infected patches (RDIP). Our results show that infection spreads monotonically in the lattice with increasing migration without showing any sign of recovery in the ICP case. In the IPP case, it follows a similar monotonic progression with increasing migration; however, a self-organized healing process starts for higher migration, leading the lattice to full recovery at a critical rate of migration. Encouragingly, for the initial RDIP arrangement, chances of recovery are much higher with a lower rate of critical migration. An eigenvalue-based semianalytical study is made to determine the critical migration rate for realizing a stable infection-free lattice. The initial fraction of infected patches and the force of infection play significant roles in the self-organized recovery. They follow an exponential law, for the RDIP case, that governs the recovery process. For the frustrating case of ICP arrangement, we propose a random rewiring of links in the lattice allowing long-distance migratory paths that effectively initiate a recovery process. Global prevalence of infection thereby declines and progressively improves with the rewiring probability that follows a power law with the critical migration and leads to the birth of emergent infection-free networks.

Mixing protocols in the public goods game

If interaction partners in social dilemma games are not selected randomly from the population but are instead determined by a network of contacts, it has far reaching consequences for the evolutionary dynamics. Selecting partners randomly leads to a well-mixed population, where pattern formation is essentially impossible. This rules out important mechanisms that can facilitate cooperation, most notably network reciprocity. In contrast, if interactions are determined by a lattice or a network, then the population is said to be structured, where cooperators can form compact clusters that protect them from invading defectors. Between these two extremes, however, there is ample middle ground that can be brought about by the consideration of temporal networks, mobility, or other coevolutionary processes. The question that we here seek to answer is, when does mixing on a lattice actually lead to well-mixed conditions? To that effect, we use the public goods game on a square lattice, and we consider nearest-neighbor and random mixing with different frequencies, as well as a mix of both mixing protocols. Not surprisingly, we find that nearest-neighbor mixing requires a higher frequency than random mixing to arrive at the well-mixed limit. The differences between the two mixing protocols are most expressed at intermediate mixing frequencies, whilst at very low and very high mixing frequencies the two almost converge. We also find a near universal exponential growth of the average size of cooperator clusters as their fraction increases from zero to one, regardless of whether this increase is due to increasing the multiplication factor of the public goods, decreasing the frequency of mixing, or gradually shifting the mixing from random to nearest neighbors.

Evolutionary dynamics drives role specialization in a community of players

The progression of game theory from classical to evolutionary and spatial games provided a powerful means to study cooperation, and enabled a better understanding of general cooperation-promoting mechanisms. However, current standard models assume that at any given point players must choose either cooperation or defection, meaning that regardless of the spatial structure in which they exist, they cannot differentiate between their neighbours and adjust their behaviour accordingly. This is at odds with interactions among organisms in nature who are well capable of behaving differently towards different members of their communities. We account for this natural fact by introducing a new type of player-dubbed link players-who can adjust their behaviour to each individual neighbour. This is in contrast to more common node players whose behaviour affects all neighbours in the same way. We proceed to study cooperation in pure and mixed populations, showing that cooperation peaks at moderately low densities of link players. In such conditions, players naturally specialize in different roles. Node players tend to be either cooperators or defectors, while link players form social insulation between cooperative and defecting clusters by acting both as cooperators and defectors. Such fairly complex processes emerging from a simple model reflect some of the complexities observed in experimental studies on social behaviour in microbes and pave a way for the development of richer game models.

Evolutionary dynamics of the delayed replicator-mutator equation: Limit cycle and cooperation

Game theory deals with strategic interactions among players and evolutionary game dynamics tracks the fate of the players' populations under selection. In this paper, we consider the replicator equation for two-player-two-strategy games involving cooperators and defectors. We modify the equation to include the effect of mutation and also delay that corresponds either to the delayed information about the population state or in realizing the effect of interaction among players. By focusing on the four exhaustive classes of symmetrical games-the Stag Hunt game, the Snowdrift game, the Prisoners' Dilemma game, and the Harmony game-we analytically and numerically analyze the delayed replicator-mutator equation to find the explicit condition for the Hopf bifurcation bringing forth stable limit cycle. The existence of the asymptotically stable limit cycle imply the coexistence of the cooperators and the defectors; and in the games, where defection is a stable Nash strategy, a stable limit cycle does provide a mechanism for evolution of cooperation. We find that while mutation alone can never lead to oscillatory cooperation state in two-player-two-strategy games, the delay can change the scenario. On the other hand, there are situations when delay alone cannot lead to the Hopf bifurcation in the absence of mutation in the selection dynamics.

Cooperation in a generalized age-structured spatial game

The emergence and prevalence of cooperative behavior within a group of selfish individuals remains a puzzle for evolutionary game theory precisely because it conflicts directly with the central idea of natural selection. Accordingly, in recent years, the search for an understanding of how cooperation can be stimulated, even when it conflicts with individual interest, has intensified. We investigate the emergence of cooperation in an age-structured evolutionary spatial game. In it, players age with time and the payoff that they receive after each round depends on their age. We find that the outcome of the game is strongly influenced by the type of distribution used to modify the payoffs according to the age of each player. The results show that, under certain circumstances, cooperators may not only survive but dominate the population.

Aspiration induced interdependence leads to optimal cooperation level

How to couple different networks is a key issue in interdependent networks, where information sharing and payoff coupling are two frequently used methods. Unlike previous studies, in this paper, we propose a new coupling mode and test its performance in interdependent networks. Specifically, a player tends to seek additional support on another network only if his environment (defined as the proportion of holding different strategies in the neighborhood) is worse enough and exceeds an aspiration level. Conversely, it turns to the traditional version on single network if his environment is pleasing enough (the value of environment is small). Whether to establish additional support will directly influence the range of selecting fittest learning objects. As we can see from numerical results, moderate aspiration introduces diversity into the system and cooperation evolves with the support of network coupling. Besides, we also demonstrate that players with external links on the boundary of cooperative clusters protect internal cooperators and attract more players to cooperate under preferential selection rule.

Individual diversity between interdependent networks promotes the evolution of cooperation by means of mixed coupling

Along with the rapid development of network-based information technology, such as cloud computing, big data, the IoT, and so on, human society has stepped into a new era of complex networks. People's life and production activities depend more and more on various complex networks to ensure security and reliability. The complex interrelationships between human and nature establish a link to explain the cooperation of individual behaviour, especially for individual diversity. However, existing researches mostly ignore the influence of individual diversity on networks involved in individual behaviour to strategy selection. Therefore, it needs further research on how to consider both individual diversity and independent networks in the evolution of cooperative behaviour. To address this issue, we extend a simple game model into the interdependent networks through the mixed coupling (i.e., utility and probability) in this work. Also, we divide the kinds of strategic behaviour of a player in one layer concerning individual diversity. Moreover, there exists an optimal region of mixed coupling between networks such that cooperation can be promoted. Finally, experimental results can open the path to understanding the emergence and maintenance of cooperation within various interconnected and interrelated real-world systems newly.

Bribery games on interdependent complex networks

Bribe demands present a social conflict scenario where decisions have wide-ranging economic and ethical consequences. Nevertheless, such incidents occur daily in many countries across the globe. Harassment bribery constitute a significant sub-set of such bribery incidents where a government official demands a bribe for providing a service to a citizen legally entitled to it. We employ an evolutionary game-theoretic framework to analyse the evolution of corrupt and honest strategies in structured populations characterized by an interdependent complex network. The effects of changing network topology, average number of links and asymmetry in size of the citizen and officer population on the proliferation of incidents of bribery are explored. A complex network topology is found to be beneficial for the dominance of corrupt strategies over a larger region of phase space when compared with the outcome for a regular network, for equal citizen and officer population sizes. However, the extent of the advantage depends critically on the network degree and topology. A different trend is observed when there is a difference between the citizen and officer population sizes. Under those circumstances, increasing randomness of the underlying citizen network can be beneficial to the fixation of honest officers up to a certain value of the network degree. Our analysis reveals how the interplay between network topology, connectivity and strategy update rules can affect population level outcomes in such asymmetric games.

Joint effect of ageing and multilayer structure prevents ordering in the voter model

The voter model rules are simple, with agents copying the state of a random neighbor, but they lead to non-trivial dynamics. Besides opinion processes, the model has also applications for catalysis and species competition. Inspired by the temporal inhomogeneities found in human interactions, one can introduce ageing in the agents: the probability to update their state decreases with the time elapsed since the last change. This modified dynamics induces an approach to consensus via coarsening in single-layer complex networks. In this work, we investigate how a multilayer structure affects the dynamics of the ageing voter model. The system is studied as a function of the fraction of nodes sharing states across layers (multiplexity parameter q). We find that the dynamics of the system suffers a notable change at an intermediate value q*. Above it, the voter model always orders to an absorbing configuration. While below it a fraction of the realizations falls into dynamical traps associated to a spontaneous symmetry breaking. In this latter case, the majority opinion in the different layers takes opposite signs and the arrival at the absorbing state is indefinitely delayed due to ageing.

Bribery games on inter-dependent regular networks

We examine a scenario of social conflict that is manifest during an interaction between government servants providing a service and citizens who are legally entitled to the service, using evolutionary game-theory in structured populations characterized by an inter-dependent network. Bribe-demands by government servants during such transactions, called harassment bribes, constitute a widespread form of corruption in many countries. We investigate the effect of varying bribe demand made by corrupt officials and the cost of complaining incurred by harassed citizens, on the proliferation of corrupt strategies in the population. We also examine how the connectivity of the various constituent networks affects the spread of corrupt officials in the population. We find that incidents of bribery can be considerably reduced in a network-structured populations compared to mixed populations. Interestingly, we also find that an optimal range for the connectivity of nodes in the citizen's network (signifying the degree of influence a citizen has in affecting the strategy of other citizens in the network) as well as the interaction network aids in the fixation of honest officers. Our results reveal the important role of network structure and connectivity in asymmetric games.

Utility Evaluation Based on One-To-N Mapping in the Prisoner's Dilemma Game for Interdependent Networks

In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems.

Stochastic win-stay-lose-shift strategy with dynamic aspirations in evolutionary social dilemmas

In times of plenty expectations rise, just as in times of crisis they fall. This can be mathematically described as a win-stay-lose-shift strategy with dynamic aspiration levels, where individuals aspire to be as wealthy as their average neighbor. Here we investigate this model in the realm of evolutionary social dilemmas on the square lattice and scale-free networks. By using the master equation and Monte Carlo simulations, we find that cooperators coexist with defectors in the whole phase diagram, even at high temptations to defect. We study the microscopic mechanism that is responsible for the striking persistence of cooperative behavior and find that cooperation spreads through second-order neighbors, rather than by means of network reciprocity that dominates in imitation-based models. For the square lattice the master equation can be solved analytically in the large temperature limit of the Fermi function, while for other cases the resulting differential equations must be solved numerically. Either way, we find good qualitative agreement with the Monte Carlo simulation results. Our analysis also reveals that the evolutionary outcomes are to a large degree independent of the network topology, including the number of neighbors that are considered for payoff determination on lattices, which further corroborates the local character of the microscopic dynamics. Unlike large-scale spatial patterns that typically emerge due to network reciprocity, here local checkerboard-like patterns remain virtually unaffected by differences in the macroscopic properties of the interaction network.

Fixation probabilities of evolutionary coordination games on two coupled populations

Evolutionary forces resulted from competitions between different populations are common, which change the evolutionary behavior of a single population. In an isolated population of coordination games of two strategies (e.g., s_{1} and s_{2}), the previous studies focused on determining the fixation probability that the system is occupied by only one strategy (s_{1}) and their expectation times, given an initial mixture of two strategies. In this work, we propose a model of two interdependent populations, disclosing the effects of the interaction strength on fixation probabilities. In the well-mixing limit, a detailed linear stability analysis is performed, which allows us to find and to classify the different equilibria, yielding a clear picture of the bifurcation patterns in phase space. We demonstrate that the interactions between populations crucially alter the dynamic behavior. More specifically, if the coupling strength is larger than some threshold value, the critical initial density of one strategy (s_{1}) that corresponds to fixation is significantly delayed. Instead, the two populations evolve to the opposite state of all (s_{2}) strategy, which are in favor of the red queen hypothesis. We delineate the extinction time of strategy (s_{1}) explicitly, which is an exponential form. These results are validated by systematic numerical simulations.

Impact of Degree Heterogeneity on Attack Vulnerability of Interdependent Networks

The study of interdependent networks has become a new research focus in recent years. We focus on one fundamental property of interdependent networks: vulnerability. Previous studies mainly focused on the impact of topological properties upon interdependent networks under random attacks, the effect of degree heterogeneity on structural vulnerability of interdependent networks under intentional attacks, however, is still unexplored. In order to deeply understand the role of degree distribution and in particular degree heterogeneity, we construct an interdependent system model which consists of two networks whose extent of degree heterogeneity can be controlled simultaneously by a tuning parameter. Meanwhile, a new quantity, which can better measure the performance of interdependent networks after attack, is proposed. Numerical simulation results demonstrate that degree heterogeneity can significantly increase the vulnerability of both single and interdependent networks. Moreover, it is found that interdependent links between two networks make the entire system much more fragile to attacks. Enhancing coupling strength between networks can greatly increase the fragility of both networks against targeted attacks, which is most evident under the case of max-max assortative coupling. Current results can help to deepen the understanding of structural complexity of complex real-world systems.

A novel framework of classical and quantum prisoner's dilemma games on coupled networks

Evolutionary games on multilayer networks are attracting growing interest. While among previous studies, the role of quantum games in such a infrastructure is still virgin and may become a fascinating issue across a myriad of research realms. To mimick two kinds of different interactive environments and mechanisms, in this paper a new framework of classical and quantum prisoner's dilemma games on two-layer coupled networks is considered. Within the proposed model, the impact of coupling factor of networks and entanglement degree in quantum games on the evolutionary process has been studied. Simulation results show that the entanglement has no impact on the evolution of the classical prisoner's dilemma, while the rise of the coupling factor obviously impedes cooperation in this game, and the evolution of quantum prisoner's dilemma is greatly impacted by the combined effect of entanglement and coupling.

Cooperation in group-structured populations with two layers of interactions

Recently there has been a growing interest in studying multiplex networks where individuals are structured in multiple network layers. Previous agent-based simulations of games on multiplex networks reveal rich dynamics arising from interdependency of interactions along each network layer, yet there is little known about analytical conditions for cooperation to evolve thereof. Here we aim to tackle this issue by calculating the evolutionary dynamics of cooperation in group-structured populations with two layers of interactions. In our model, an individual is engaged in two layers of group interactions simultaneously and uses unrelated strategies across layers. Evolutionary competition of individuals is determined by the total payoffs accrued from two layers of interactions. We also consider migration which allows individuals to move to a new group within each layer. An approach combining the coalescence theory with the theory of random walks is established to overcome the analytical difficulty upon local migration. We obtain the exact results for all “isotropic” migration patterns, particularly for migration tuned with varying ranges. When the two layers use one game, the optimal migration ranges are proved identical across layers and become smaller as the migration probability grows.

Extreme events in multilayer, interdependent complex networks and control

We investigate the emergence of extreme events in interdependent networks. We introduce an inter-layer traffic resource competing mechanism to account for the limited capacity associated with distinct network layers. A striking finding is that, when the number of network layers and/or the overlap among the layers are increased, extreme events can emerge in a cascading manner on a global scale. Asymptotically, there are two stable absorption states: a state free of extreme events and a state of full of extreme events, and the transition between them is abrupt. Our results indicate that internal interactions in the multiplex system can yield qualitatively distinct phenomena associated with extreme events that do not occur for independent network layers. An implication is that, e.g., public resource competitions among different service providers can lead to a higher resource requirement than naively expected. We derive an analytical theory to understand the emergence of global-scale extreme events based on the concept of effective betweenness. We also articulate a cost-effective control scheme through increasing the capacity of very few hubs to suppress the cascading process of extreme events so as to protect the entire multi-layer infrastructure against global-scale breakdown.

Heterogeneous Coupling between Interdependent Lattices Promotes the Cooperation in the Prisoner's Dilemma Game

In the research realm of game theory, interdependent networks have extended the content of spatial reciprocity, which needs the suitable coupling between networks. However, thus far, the vast majority of existing works just assume that the coupling strength between networks is symmetric. This hypothesis, to some extent, seems inconsistent with the ubiquitous observation of heterogeneity. Here, we study how the heterogeneous coupling strength, which characterizes the interdependency of utility between corresponding players of both networks, affects the evolution of cooperation in the prisoner's dilemma game with two types of coupling schemes (symmetric and asymmetric ones). Compared with the traditional case, we show that heterogeneous coupling greatly promotes the collective cooperation. The symmetric scheme seems much better than the asymmetric case. Moreover, the role of varying amplitude of coupling strength is also studied on these two interdependent ways. Current findings are helpful for us to understand the evolution of cooperation within many real-world systems, in particular for the interconnected and interrelated systems.

Analytical description for the critical fixations of evolutionary coordination games on finite complex structured populations

Evolutionary game theory is crucial to capturing the characteristic interaction patterns among selfish individuals. In a population of coordination games of two strategies, one of the central problems is to determine the fixation probability that the system reaches a state of networkwide of only one strategy, and the corresponding expectation times. The deterministic replicator equations predict the critical value of initial density of one strategy, which separates the two absorbing states of the system. However, numerical estimations of this separatrix show large deviations from the theory in finite populations. Here we provide a stochastic treatment of this dynamic process on complex networks of finite sizes as Markov processes, showing the evolutionary time explicitly. We describe analytically the effects of network structures on the intermediate fixations as observed in numerical simulations. Our theoretical predictions are validated by various simulations on both random and scale free networks. Therefore, our stochastic framework can be helpful in dealing with other networked game dynamics.

Controllability of time-delayed Boolean multiplex control networks under asynchronous stochastic update

In this article, the controllability of asynchronous Boolean multiplex control networks (ABMCNs) with time delay is studied. Firstly, dynamical model of Boolean multiplex control networks is constructed, which is assumed to be under Harvey' asynchronous update and time delay is introduced both in states and controls. By using of semi-tensor product (STP) approach, the logical dynamics is converted into an equivalent algebraic form by obtaining the control-depending network transition matrices of delayed system. Secondly, a necessary and sufficient condition is proved that only control-depending fixed points of the studied dynamics can be controlled with probability one. Thirdly, respectively for two types of controls, the controllability of dynamical control system is investigated. When initial states and time delay are given, formulae are obtained to show a) the reachable set at time s under specified controls; b) the reachable set at time s under arbitrary controls; c) the reachable probabilities to different destination states. Furthermore, an approach is discussed to find a precise control sequence which can steer dynamical system into a specified target with the maximum reachable probability. Examples are shown to illustrate the feasibility of the proposed scheme.

The structure and dynamics of multilayer networks

In the past years, network theory has successfully characterized the interaction among the constituents of a variety of complex systems, ranging from biological to technological, and social systems. However, up until recently, attention was almost exclusively given to networks in which all components were treated on equivalent footing, while neglecting all the extra information about the temporal- or context-related properties of the interactions under study. Only in the last years, taking advantage of the enhanced resolution in real data sets, network scientists have directed their interest to the multiplex character of real-world systems, and explicitly considered the time-varying and multilayer nature of networks. We offer here a comprehensive review on both structural and dynamical organization of graphs made of diverse relationships (layers) between its constituents, and cover several relevant issues, from a full redefinition of the basic structural measures, to understanding how the multilayer nature of the network affects processes and dynamics.

Controllability of asynchronous Boolean multiplex control networks

In this article, the controllability of asynchronous Boolean multiplex control networks (ABMCNs) is studied. First, the model of Boolean multiplex control networks under Harvey' asynchronous update is presented. By means of semi-tensor product approach, the logical dynamics is converted into linear representation, and a generalized formula of control-depending network transition matrices is achieved. Second, a necessary and sufficient condition is proposed to verify that only control-depending fixed points of ABMCNs can be controlled with probability one. Third, using two types of controls, the controllability of system is studied and formulae are given to show: (a) when an initial state is given, the reachable set at time s under a group of specified controls; (b) the reachable set at time s under arbitrary controls; (c) the specific probability values from a given initial state to destination states. Based on the above formulae, an algorithm to calculate overall reachable states from a specified initial state is presented. Moreover, we also discuss an approach to find the particular control sequence which steers the system between two states with maximum probability. Examples are shown to illustrate the feasibility of the proposed scheme.

Evolution of staying together in the context of diffusible public goods

We study the coevolution of staying together and cooperation. Staying together means that replicating units do not separate after reproduction, but remain in proximity. For example, following cell division the two daughter cells may not fully separate but stay attached to each other. Repeated cell division thereby can lead to a simple multi-cellular complex. We assume that cooperators generate a diffusible public good, which can be absorbed by any cell in the system. The production of the public good entails a cost, while the absorption leads to a benefit. Defectors produce no public good. Defectors have a selective advantage unless a mechanism for evolution of cooperation is at work. Here we explore the idea that the public good produced by a cooperating cell is absorbed by cells of the same complex with a probability that depends on the size of the complex. Larger complexes are better at absorbing the public goods produced by their own individuals. We derive analytical conditions for the evolution of staying together, thereby studying the coevolution of clustering and cooperation. If cooperators and defectors differ in their intrinsic efficiency to absorb the public good, then we find multiple stable equilibria and the possibility for coexistence between cooperators and defectors. Finally we study the implications of disadvantages that might arise if complexes become too large.

Degree mixing in multilayer networks impedes the evolution of cooperation

Traditionally, the evolution of cooperation has been studied on single, isolated networks. Yet a player, especially in human societies, will typically be a member of many different networks, and those networks will play different roles in the evolutionary process. Multilayer networks are therefore rapidly gaining on popularity as the more apt description of a networked society. With this motivation, we here consider two-layer scale-free networks with all possible combinations of degree mixing, wherein one network layer is used for the accumulation of payoffs and the other is used for strategy updating. We find that breaking the symmetry through assortative mixing in one layer and/or disassortative mixing in the other layer, as well as preserving the symmetry by means of assortative mixing in both layers, impedes the evolution of cooperation. We use degree-dependent distributions of strategies and cluster-size analysis to explain these results, which highlight the importance of hubs and the preservation of symmetry between multilayer networks for the successful resolution of social dilemmas.

Evolutionary origin of asymptotically stable consensus

Consensus is widely observed in nature as well as in society. Up to now, many works have focused on what kind of (and how) isolated single structures lead to consensus, while the dynamics of consensus in interdependent populations remains unclear, although interactive structures are everywhere. For such consensus in interdependent populations, we refer that the fraction of population adopting a specified strategy is the same across different interactive structures. A two-strategy game as a conflict is adopted to explore how natural selection affects the consensus in such interdependent populations. It is shown that when selection is absent, all the consensus states are stable, but none are evolutionarily stable. In other words, the final consensus state can go back and forth from one to another. When selection is present, there is only a small number of stable consensus state which are evolutionarily stable. Our study highlights the importance of evolution on stabilizing consensus in interdependent populations.

Biased imitation in coupled evolutionary games in interdependent networks

We explore the evolutionary dynamics of two games—the Prisoner's Dilemma and the Snowdrift Game—played within distinct networks (layers) of interdependent networks. In these networks imitation and interaction between individuals of opposite layers is established through interlinks. We explore an update rule in which revision of strategies is a biased imitation process: individuals imitate neighbors from the same layer with probability p, and neighbors from the second layer with complementary probability 1 − p. We demonstrate that a small decrease of p from p = 1 (which corresponds to forbidding strategy transfer between layers) is sufficient to promote cooperation in the Prisoner's Dilemma subpopulation. This, on the other hand, is detrimental for cooperation in the Snowdrift Game subpopulation. We provide results of extensive computer simulations for the case in which layers are modelled as regular random networks, and support this study with analytical results for coupled well-mixed populations.

Spontaneous symmetry breaking in interdependent networked game

Spatial evolution game has traditionally assumed that players interact with direct neighbors on a single network, which is isolated and not influenced by other systems. However, this is not fully consistent with recent research identification that interactions between networks play a crucial rule for the outcome of evolutionary games taking place on them. In this work, we introduce the simple game model into the interdependent networks composed of two networks. By means of imitation dynamics, we display that when the interdependent factor α is smaller than a threshold value α(C), the symmetry of cooperation can be guaranteed. Interestingly, as interdependent factor exceeds α(C), spontaneous symmetry breaking of fraction of cooperators presents itself between different networks. With respect to the breakage of symmetry, it is induced by asynchronous expansion between heterogeneous strategy couples of both networks, which further enriches the content of spatial reciprocity. Moreover, our results can be well predicted by the strategy-couple pair approximation method.

Moderate intra-group bias maximizes cooperation on interdependent populations

Evolutionary game theory on spatial structures has received increasing attention during the past decades. However, the majority of these achievements focuses on single and static population structures, which is not fully consistent with the fact that real structures are composed of many interactive groups. These groups are interdependent on each other and present dynamical features, in which individuals mimic the strategy of neighbors and switch their partnerships continually. It is however unclear how the dynamical and interdependent interactions among groups affect the evolution of collective behaviors. In this work, we employ the prisoner's dilemma game to investigate how the dynamics of structure influences cooperation on interdependent populations, where populations are represented by group structures. It is found that the more robust the links between cooperators (or the more fragile the links between cooperators and defectors), the more prevalent of cooperation. Furthermore, theoretical analysis shows that the intra-group bias can favor cooperation, which is only possible when individuals are likely to attach neighbors within the same group. Yet, interestingly, cooperation can be even inhibited for large intra-group bias, allowing the moderate intra-group bias maximizes the cooperation level.

Insight into the so-called spatial reciprocity

Up to now, there have been a great number of studies that demonstrate the effect of spatial topology on the promotion of cooperation dynamics (namely, the so-called "spatial reciprocity"). However, most researchers probably attribute it to the positive assortment of strategies supported by spatial arrangement. In this paper, we analyze the time course of cooperation evolution under different evolution rules. Interestingly, a typical evolution process can be divided into two evident periods: the enduring (END) period and the expanding (EXP) period where the former features that cooperators try to endure defectors' invasion and the latter shows that perfect C clusters fast expand their area. We find that the final cooperation level relies on two key factors: the formation of the perfect C cluster at the end of the END period and the expanding fashion of the perfect C cluster during the EXP period. For deterministic rule, the smooth expansion of C cluster boundaries enables cooperators to reach a dominant state, whereas, the rough boundaries for stochastic rule cannot provide a sufficient beneficial environment for the evolution of cooperation. Moreover, we show that expansion of the perfect C cluster is closely related to the cluster coefficient of interaction topology. To some extent, we present a viable method for understanding the spatial reciprocity mechanism in nature and hope that it will inspire further studies to resolve social dilemmas.

Interdependent network reciprocity in evolutionary games

Besides the structure of interactions within networks, also the interactions between networks are of the outmost importance. We therefore study the outcome of the public goods game on two interdependent networks that are connected by means of a utility function, which determines how payoffs on both networks jointly influence the success of players in each individual network. We show that an unbiased coupling allows the spontaneous emergence of interdependent network reciprocity, which is capable to maintain healthy levels of public cooperation even in extremely adverse conditions. The mechanism, however, requires simultaneous formation of correlated cooperator clusters on both networks. If this does not emerge or if the coordination process is disturbed, network reciprocity fails, resulting in the total collapse of cooperation. Network interdependence can thus be exploited effectively to promote cooperation past the limits imposed by isolated networks, but only if the coordination between the interdependent networks is not disturbed.

Spreading of cooperative behaviour across interdependent groups

Recent empirical research has shown that links between groups reinforce individuals within groups to adopt cooperative behaviour. Moreover, links between networks may induce cascading failures, competitive percolation, or contribute to efficient transportation. Here we show that there in fact exists an intermediate fraction of links between groups that is optimal for the evolution of cooperation in the prisoner's dilemma game. We consider individual groups with regular, random, and scale-free topology, and study their different combinations to reveal that an intermediate interdependence optimally facilitates the spreading of cooperative behaviour between groups. Excessive between-group links simply unify the two groups and make them act as one, while too rare between-group links preclude a useful information flow between the two groups. Interestingly, we find that between-group links are more likely to connect two cooperators than in-group links, thus supporting the conclusion that they are of paramount importance.

Optimal interdependence between networks for the evolution of cooperation

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.