Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Ordering structured populations in multiplayer cooperation games.

ABSTRACT: Spatial structure greatly affects the evolution of cooperation. While in two-player games the condition for cooperation to evolve depends on a single structure coefficient, in multiplayer games the condition might depend on several structure coefficients, making it difficult to compare different population structures. We propose a solution to this issue by introducing two simple ways of ordering population structures: the containment order and the volume order. If population structure S1 is greater than population structure S1 in the containment or the volume order, then S1 can be considered a stronger promoter of cooperation. We provide conditions for establishing the containment order, give general results on the volume order, and illustrate our theory by comparing different models of spatial games and associated update rules. Our results hold for a large class of population structures and can be easily applied to specific cases once the structure coefficients have been calculated or estimated.

SUBMITTER: Pena J

PROVIDER: S-EPMC4759793 | biostudies-literature | 2016 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Ordering structured populations in multiplayer cooperation games.

Peña Jorge J Wu Bin B Traulsen Arne A

Journal of the Royal Society, Interface 20160101 114

Spatial structure greatly affects the evolution of cooperation. While in two-player games the condition for cooperation to evolve depends on a single structure coefficient, in multiplayer games the condition might depend on several structure coefficients, making it difficult to compare different population structures. We propose a solution to this issue by introducing two simple ways of ordering population structures: the containment order and the volume order. If population structure S1 is grea ...[more]

PMID: 26819335

Similar Datasets

Evolutionary Games of Multiplayer Cooperation on Graphs.

Project description:There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering.

| S-EPMC4981334 | biostudies-literature

Navigating the landscape of multiplayer games.

Project description:Multiplayer games have long been used as testbeds in artificial intelligence research, aptly referred to as the Drosophila of artificial intelligence. Traditionally, researchers have focused on using well-known games to build strong agents. This progress, however, can be better informed by characterizing games and their topological landscape. Tackling this latter question can facilitate understanding of agents and help determine what game an agent should target next as part of its training. Here, we show how network measures applied to response graphs of large-scale games enable the creation of a landscape of games, quantifying relationships between games of varying sizes and characteristics. We illustrate our findings in domains ranging from canonical games to complex empirical games capturing the performance of trained agents pitted against one another. Our results culminate in a demonstration leveraging this information to generate new and interesting games, including mixtures of empirical games synthesized from real world games.

| S-EPMC7645690 | biostudies-literature

Evolutionary multiplayer games on graphs with edge diversity.

Project description:Evolutionary game dynamics in structured populations has been extensively explored in past decades. However, most previous studies assume that payoffs of individuals are fully determined by the strategic behaviors of interacting parties, and social ties between them only serve as the indicator of the existence of interactions. This assumption neglects important information carried by inter-personal social ties such as genetic similarity, geographic proximity, and social closeness, which may crucially affect the outcome of interactions. To model these situations, we present a framework of evolutionary multiplayer games on graphs with edge diversity, where different types of edges describe diverse social ties. Strategic behaviors together with social ties determine the resulting payoffs of interactants. Under weak selection, we provide a general formula to predict the success of one behavior over the other. We apply this formula to various examples which cannot be dealt with using previous models, including the division of labor and relationship- or edge-dependent games. We find that labor division can promote collective cooperation markedly. The evolutionary process based on relationship-dependent games can be approximated by interactions under a transformed and unified game. Our work stresses the importance of social ties and provides effective methods to reduce the calculating complexity in analyzing the evolution of realistic systems.

| S-EPMC6459562 | biostudies-literature

Parent-preferred dispersal promotes cooperation in structured populations.

Project description:Dispersal is a key process for the emergence of social and biological behaviours. Yet, little attention has been paid to dispersal's effects on the evolution of cooperative behaviour in structured populations. To address this issue, we propose two new dispersal modes, parent-preferred and offspring-preferred dispersal, incorporate them into the birth-death update rule, and consider the resultant strategy evolution in the prisoner's dilemma on random-regular, small-world, and scale-free networks, respectively. We find that parent-preferred dispersal favours the evolution of cooperation in these different types of population structures, while offspring-preferred dispersal inhibits the evolution of cooperation in homogeneous populations. On scale-free networks when the strength of parent-preferred dispersal is weak, cooperation can be enhanced at intermediate strengths of offspring-preferred dispersal, and cooperators can coexist with defectors at high strengths of offspring-preferred dispersal. Moreover, our theoretical analysis based on the pair-approximation method corroborates the evolutionary outcomes on random-regular networks. We also incorporate the two new dispersal modes into three other update rules (death-birth, imitation, and pairwise comparison updating), and find that similar results about the effects of parent-preferred and offspring-preferred dispersal can again be observed in the aforementioned different types of population structures. Our work, thus, unveils robust effects of preferential dispersal modes on the evolution of cooperation in different interactive environments.

| S-EPMC6364582 | biostudies-literature

Cooperation and control in multiplayer social dilemmas.

Project description:Direct reciprocity and conditional cooperation are important mechanisms to prevent free riding in social dilemmas. However, in large groups, these mechanisms may become ineffective because they require single individuals to have a substantial influence on their peers. However, the recent discovery of zero-determinant strategies in the iterated prisoner's dilemma suggests that we may have underestimated the degree of control that a single player can exert. Here, we develop a theory for zero-determinant strategies for iterated multiplayer social dilemmas, with any number of involved players. We distinguish several particularly interesting subclasses of strategies: fair strategies ensure that the own payoff matches the average payoff of the group; extortionate strategies allow a player to perform above average; and generous strategies let a player perform below average. We use this theory to describe strategies that sustain cooperation, including generalized variants of Tit-for-Tat and Win-Stay Lose-Shift. Moreover, we explore two models that show how individuals can further enhance their strategic options by coordinating their play with others. Our results highlight the importance of individual control and coordination to succeed in large groups.

| S-EPMC4246307 | biostudies-literature

Cooperation in group-structured populations with two layers of interactions.

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

| S-EPMC4668372 | biostudies-literature

Evolving cooperation in multichannel games.

Project description:Humans routinely engage in many distinct interactions in parallel. Team members collaborate on several concurrent projects, and even whole nations interact with each other across a variety of issues, including trade, climate change and security. Yet the existing theory of direct reciprocity studies isolated repeated games. Such models cannot account for strategic attempts to use the vested interests in one game as a leverage to enforce cooperation in another. Here we introduce a general framework of multichannel games. Individuals interact with each other over multiple channels; each channel is a repeated game. Strategic choices in one channel can affect decisions in another. With analytical equilibrium calculations for the donation game and evolutionary simulations for several other games we show that such linkage facilitates cooperation. Our results suggest that previous studies tend to underestimate the human potential for reciprocity. When several interactions occur in parallel, people often learn to coordinate their behavior across games to maximize cooperation in each of them.

| S-EPMC7403149 | biostudies-literature

Joint evolution of kin recognition and cooperation in spatially structured rhizobium populations.

Project description:In the face of costs, cooperative interactions maintained over evolutionary time present a central question in biology. What forces maintain this cooperation? Two potential ways to explain this problem are spatially structured environments (kin selection) and kin-recognition (directed benefits). In a two-locus population genetic model, we investigated the relative roles of spatial structure and kin recognition in the maintenance of cooperation among rhizobia within the rhizobia-legume mutualism. In the case where the cooperative and kin recognition loci are independently inherited, spatial structure alone maintains cooperation, while kin recognition decreases the equilibrium frequency of cooperators. In the case of co-inheritance, spatial structure remains a stronger force, but kin recognition can transiently increase the frequency of cooperators. Our results suggest that spatial structure can be a dominant force in maintaining cooperation in rhizobium populations, providing a mechanism for maintaining the mutualistic nodulation trait. Further, our model generates unique and testable predictions that could be evaluated empirically within the legume-rhizobium mutualism.

| S-EPMC3999197 | biostudies-literature

Defection and extortion as unexpected catalysts of unconditional cooperation in structured populations.

Project description:We study the evolution of cooperation in the spatial prisoner's dilemma game, where besides unconditional cooperation and defection, tit-for-tat, win-stay-lose-shift and extortion are the five competing strategies. While pairwise imitation fails to sustain unconditional cooperation and extortion regardless of game parametrization, myopic updating gives rise to the coexistence of all five strategies if the temptation to defect is sufficiently large or if the degree distribution of the interaction network is heterogeneous. This counterintuitive evolutionary outcome emerges as a result of an unexpected chain of strategy invasions. Firstly, defectors emerge and coarsen spontaneously among players adopting win-stay-lose-shift. Secondly, extortioners and players adopting tit-for-tat emerge and spread via neutral drift among the emerged defectors. And lastly, among the extortioners, cooperators become viable too. These recurrent evolutionary invasions yield a five-strategy phase that is stable irrespective of the system size and the structure of the interaction network, and they reveal the most unexpected mechanism that stabilizes extortion and cooperation in an evolutionary setting.

| S-EPMC4074784 | biostudies-other

Bipartite graphs as models of population structures in evolutionary multiplayer games.

Project description:By combining evolutionary game theory and graph theory, "games on graphs" study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner's dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner's dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures.

| S-EPMC3438187 | 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