Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Biased imitation in coupled evolutionary games in interdependent networks.

ABSTRACT: 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.

SUBMITTER: Santos MD

PROVIDER: S-EPMC3963071 | biostudies-literature | 2014 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Biased imitation in coupled evolutionary games in interdependent networks.

Santos M D MD Dorogovtsev S N SN Mendes J F F JF

Scientific reports 20140324

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 pro ...[more]

PMID: 24658580

Similar Datasets

Interdependent network reciprocity in evolutionary games.

Project description: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.

| S-EPMC3560361 | biostudies-other

Evolutionary games of condensates in coupled birth-death processes.

Project description:Condensation phenomena arise through a collective behaviour of particles. They are observed in both classical and quantum systems, ranging from the formation of traffic jams in mass transport models to the macroscopic occupation of the energetic ground state in ultra-cold bosonic gases (Bose-Einstein condensation). Recently, it has been shown that a driven and dissipative system of bosons may form multiple condensates. Which states become the condensates has, however, remained elusive thus far. The dynamics of this condensation are described by coupled birth-death processes, which also occur in evolutionary game theory. Here we apply concepts from evolutionary game theory to explain the formation of multiple condensates in such driven-dissipative bosonic systems. We show that the vanishing of relative entropy production determines their selection. The condensation proceeds exponentially fast, but the system never comes to rest. Instead, the occupation numbers of condensates may oscillate, as we demonstrate for a rock-paper-scissors game of condensates.

| S-EPMC4421816 | biostudies-literature

Evolutionary games on multilayer networks: coordination and equilibrium selection.

Project description:We study mechanisms of synchronisation, coordination, and equilibrium selection in two-player coordination games on multilayer networks. We investigate three possible update rules: the replicator dynamics (RD), the best response (BR), and the unconditional imitation (UI). Players interact on a two-layer random regular network. The population on each layer plays a different game, with layer I preferring the opposite strategy to layer II. We measure the difference between the two games played on the layers by a difference in payoffs, and the inter-connectedness by a node overlap parameter. We discover a critical value of the overlap below which layers do not synchronise, i.e. they display different levels of coordination. Above this threshold both layers typically coordinate on the same strategy. Surprisingly, there is a symmetry breaking in the selection of equilibrium-for RD and UI there is a phase where only the payoff-dominant equilibrium is selected. It is not observed, however, for BR update rule. Our work is an example of previously observed differences between the update rules. Nonetheless, we took a novel approach with the game being played on two inter-connected layers. As we show, the multilayer structure enhances the abundance of the Pareto-optimal equilibrium in coordination games with imitative update rules.

| S-EPMC10362047 | biostudies-literature

Metric clusters in evolutionary games on scale-free networks.

Project description:The evolution of cooperation in social dilemmas in structured populations has been studied extensively in recent years. Whereas many theoretical studies have found that a heterogeneous network of contacts favors cooperation, the impact of spatial effects in scale-free networks is still not well understood. In addition to being heterogeneous, real contact networks exhibit a high mean local clustering coefficient, which implies the existence of an underlying metric space. Here we show that evolutionary dynamics in scale-free networks self-organize into spatial patterns in the underlying metric space. The resulting metric clusters of cooperators are able to survive in social dilemmas as their spatial organization shields them from surrounding defectors, similar to spatial selection in Euclidean space. We show that under certain conditions these metric clusters are more efficient than the most connected nodes at sustaining cooperation and that heterogeneity does not always favor-but can even hinder-cooperation in social dilemmas.

| S-EPMC5709505 | biostudies-literature

Recovery of Interdependent Networks.

Project description:Recent network research has focused on the cascading failures in a system of interdependent networks and the necessary preconditions for system collapse. An important question that has not been addressed is how to repair a failing system before it suffers total breakdown. Here we introduce a recovery strategy for nodes and develop an analytic and numerical framework for studying the concurrent failure and recovery of a system of interdependent networks based on an efficient and practically reasonable strategy. Our strategy consists of repairing a fraction of failed nodes, with probability of recovery γ, that are neighbors of the largest connected component of each constituent network. We find that, for a given initial failure of a fraction 1 - p of nodes, there is a critical probability of recovery above which the cascade is halted and the system fully restores to its initial state and below which the system abruptly collapses. As a consequence we find in the plane γ - p of the phase diagram three distinct phases. A phase in which the system never collapses without being restored, another phase in which the recovery strategy avoids the breakdown, and a phase in which even the repairing process cannot prevent system collapse.

| S-EPMC4783785 | biostudies-literature

Redundant Design in Interdependent Networks.

Project description:Modern infrastructure networks are often coupled together and thus could be modeled as interdependent networks. Overload and interdependent effect make interdependent networks more fragile when suffering from attacks. Existing research has primarily concentrated on the cascading failure process of interdependent networks without load, or the robustness of isolated network with load. Only limited research has been done on the cascading failure process caused by overload in interdependent networks. Redundant design is a primary approach to enhance the reliability and robustness of the system. In this paper, we propose two redundant methods, node back-up and dependency redundancy, and the experiment results indicate that two measures are effective and costless. Two detailed models about redundant design are introduced based on the non-linear load-capacity model. Based on the attributes and historical failure distribution of nodes, we introduce three static selecting strategies-Random-based, Degree-based, Initial load-based and a dynamic strategy-HFD (historical failure distribution) to identify which nodes could have a back-up with priority. In addition, we consider the cost and efficiency of different redundant proportions to determine the best proportion with maximal enhancement and minimal cost. Experiments on interdependent networks demonstrate that the combination of HFD and dependency redundancy is an effective and preferred measure to implement redundant design on interdependent networks. The results suggest that the redundant design proposed in this paper can permit construction of highly robust interactive networked systems.

| S-EPMC5072686 | biostudies-literature

Crash dynamics of interdependent networks.

Project description:The emergence and evolution of real-world systems have been extensively studied in the last few years. However, equally important phenomena are related to the dynamics of systems' collapse, which has been less explored, especially when they can be cast into interdependent systems. In this paper, we develop a dynamical model that allows scrutinizing the collapse of systems composed of two interdependent networks. Specifically, we explore the dynamics of the system's collapse under two scenarios: in the first one, the condition for failure should be satisfied for the focal node as well as for its corresponding node in the other network; while in the second one, it is enough that failure of one of the nodes occurs in either of the two networks. We report extensive numerical simulations of the dynamics performed in different setups of interdependent networks, and analyze how the system behavior depends on the previous scenarios as well as on the topology of the interdependent system. Our results can provide valuable insights into the crashing dynamics and evolutionary properties of interdependent complex systems.

| S-EPMC6787334 | biostudies-literature

Breakdown of interdependent directed networks.

Project description:Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networks. However, most real-world networks are directed, their in-degrees and out-degrees may be correlated, and they are often coupled to one another as interdependent directed networks. To understand the breakdown and robustness of interdependent directed networks, we develop a theoretical framework based on generating functions and percolation theory. We find that for interdependent Erdős-Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions. We also find that the percolation behavior of interdependent directed scale-free networks with and without degree correlations is so complex that two criteria are needed to quantify and compare their robustness: the percolation threshold and the integrated size of the giant component during an entire attack process. Interestingly, we find that the in-degree and out-degree correlations in each network layer increase the robustness of interdependent degree heterogeneous networks that most real networks are, but decrease the robustness of interdependent networks with homogeneous degree distribution and with strong coupling strengths. Moreover, by applying our theoretical analysis to real interdependent international trade networks, we find that the robustness of these real-world systems increases with the in-degree and out-degree correlations, confirming our theoretical analysis.

| S-EPMC4747761 | biostudies-literature

Bacterial intelligence: imitation games, time-sharing, and long-range quantum coherence.

Project description:Bacteria are far more intelligent than we can think of. They adopt different survival strategies to make their life comfortable. Researches on bacterial communication to date suggest that bacteria can communicate with each other using chemical signaling molecules as well as using ion channel mediated electrical signaling. Though in past few decades the scopes of chemical signaling have been investigated extensively, those of electrical signaling have received less attention. In this article, we present a novel perspective on time-sharing behavior, which maintains the biofilm growth under reduced nutrient supply between two distant biofilms through electrical signaling based on the experimental evidence reported by Liu et al., in 2017. In addition, following the recent work by Humphries et al. Cell 168(1):200-209, in 2017, we highlight the consequences of long range electrical signaling within biofilm communities through spatially propagating waves of potassium. Furthermore, we address the possibility of two-way cellular communication between artificial and natural cells through chemical signaling being inspired by recent experimental observation (Lentini et al. 2017) where the efficiency of artificial cells in imitating the natural cells is estimated through cellular Turing test. These three spectacular observations lead us to envisage and devise new classical and quantum views of these complex biochemical networks that have never been realized previously.

| S-EPMC5559398 | biostudies-literature

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

Project description: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.

| S-EPMC4792163 | biostudies-other

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data