Multi-player games on the cycle

Evolution of cooperation with respect to fixation probabilities in multi-player games with random payoffs

We study the effect of variability in payoffs on the evolution of cooperation (C) against defection (D) in multi-player games in a finite well-mixed population. We show that an increase in the covariance between any two payoffs to D, or a decrease in the covariance between any two payoffs to C, increases the probability of ultimate fixation of C when represented once, and decreases the corresponding fixation probability for D. This is also the case with an increase in the covariance between any payoff to C and any payoff to D if and only if the sum of the numbers of C-players in the group associated with these payoffs is large enough compared to the group size. In classical social dilemmas with random cost and benefit for cooperation, the evolution of C is more likely to occur if the variances of the cost and benefit, as well as the group size, are small, while the covariance between cost and benefit is large.

Intriguing effects of selection intensity on the evolution of prosocial behaviors

In many models of evolving populations, genetic drift has an outsized role relative to natural selection, or vice versa. While there are many scenarios in which one of these two assumptions is reasonable, intermediate balances between these forces are also biologically relevant. In this study, we consider some natural axioms for modeling intermediate selection intensities, and we explore how to quantify the long-term evolutionary dynamics of such a process. To illustrate the sensitivity of evolutionary dynamics to drift and selection, we show that there can be a “sweet spot” for the balance of these two forces, with sufficient noise for rare mutants to become established and sufficient selection to spread. This balance allows prosocial traits to evolve in evolutionary models that were previously thought to be unconducive to the emergence and spread of altruistic behaviors. Furthermore, the effects of selection intensity on long-run evolutionary outcomes in these settings, such as when there is global competition for reproduction, can be highly non-monotonic. Although intermediate selection intensities (neither weak nor strong) are notoriously difficult to study analytically, they are often biologically relevant; and the results we report suggest that they can elicit novel and rich dynamics in the evolution of prosocial behaviors.

Theoretical models of populations have been useful for assessing when and how traits spread, in large part because they are simple. Rather than being used to reproduce empirical data, these idealized models involve relatively few parameters and are utilized to gain a qualitative understanding of what promotes or suppresses a trait. For prosocial traits, which entail a cost to self to help another, one thing that mathematical models often suggest is that competition to reproduce must be localized, meaning an individual must be fitter than just a small subset of the population in order to produce an offspring. We show here that this finding is not robust. Such traits can indeed proliferate when there is global competition for reproduction, which we demonstrate by increasing the degree to which payoffs from games affect birth rates. Since this kind of “stronger selection” has also been observed empirically, we discuss how it is incorporated into theoretical models more broadly.

Strategically influencing an uncertain future

Many of today's most pressing societal concerns require decisions which take into account a distant and uncertain future. Recent developments in strategic decision-making suggest that individuals, or a small group of individuals, can unilaterally influence the collective outcome of such complex social dilemmas. However, these results do not account for the extent to which decisions are moderated by uncertainty in the probability or timing of future outcomes that characterise the valuation of a (distant) uncertain future. Here we develop a general framework that captures interactions among uncertainty, the resulting time-inconsistent discounting, and their consequences for decision-making processes. In deterministic limits, existing theories can be recovered. More importantly, new insights are obtained into the possibilities for strategic influence when the valuation of the future is uncertain. We show that in order to unilaterally promote and sustain cooperation in social dilemmas, decisions of generous and extortionate strategies should be adjusted to the level of uncertainty. In particular, generous payoff relations cannot be enforced during periods of greater risk (which we term the "generosity gap"), unless the strategic enforcer orients their strategy towards a more distant future by consistently choosing "selfless" cooperative decisions; likewise, the possibilities for extortion are directly limited by the level of uncertainty. Our results have implications for policies that aim to solve societal concerns with consequences for a distant future and provides a theoretical starting point for investigating how collaborative decision-making can help solve long-standing societal dilemmas.

The effect of network topology on optimal exploration strategies and the evolution of cooperation in a mobile population

We model a mobile population interacting over an underlying spatial structure using a Markov movement model. Interactions take the form of public goods games, and can feature an arbitrary group size. Individuals choose strategically to remain at their current location or to move to a neighbouring location, depending upon their exploration strategy and the current composition of their group. This builds upon previous work where the underlying structure was a complete graph (i.e. there was effectively no structure). Here, we consider alternative network structures and a wider variety of, mainly larger, populations. Previously, we had found when cooperation could evolve, depending upon the values of a range of population parameters. In our current work, we see that the complete graph considered before promotes stability, with populations of cooperators or defectors being relatively hard to replace. By contrast, the star graph promotes instability, and often neither type of population can resist replacement. We discuss potential reasons for this in terms of network topology.

Computation and Simulation of Evolutionary Game Dynamics in Finite Populations

The study of evolutionary dynamics increasingly relies on computational methods, as more and more cases outside the range of analytical tractability are explored. The computational methods for simulation and numerical approximation of the relevant quantities are diverging without being compared for accuracy and performance. We thoroughly investigate these algorithms in order to propose a reliable standard. For expositional clarity we focus on symmetric 2 × 2 games leading to one-dimensional processes, noting that extensions can be straightforward and lessons will often carry over to more complex cases. We provide time-complexity analysis and systematically compare three families of methods to compute fixation probabilities, fixation times and long-term stationary distributions for the popular Moran process. We provide efficient implementations that substantially improve wall times over naive or immediate implementations. Implications are also discussed for the Wright-Fisher process, as well as structured populations and multiple types.

Evolutionary multiplayer games on graphs with edge diversity

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.

Dynamics of multiplayer games on complex networks using territorial interactions

The modeling of evolution in structured populations has been significantly advanced by evolutionary graph theory, which incorporates pairwise relationships between individuals on a network. More recently, a new framework has been developed to allow for multiplayer interactions of variable size in more flexible and potentially changing population structures. While the theory within this framework has been developed and simple structures considered, there has been no systematic consideration of a large range of different population structures, which is the subject of this paper. We consider a large range of underlying graphical structures for the territorial raider model, the most commonly used model in the new structure, and consider a variety of important properties of our structures with the aim of finding factors that determine the fixation probability of mutants. We find that the graphical temperature and the average group size, as previously defined, are strong predictors of fixation probability, while all other properties considered are poor predictors, although the clustering coefficient is a useful secondary predictor when combined with either temperature or group size. The relationship between temperature or average group size and fixation probability is sometimes, however, nonmonotonic, with a directional reverse occurring around the temperature associated with what we term "completely mixed" populations in the case of the hawk-dove game, but not the public goods game.

Generalized Social Dilemmas: The Evolution of Cooperation in Populations with Variable Group Size

Evolutionary game theory is an important tool to model animal and human behaviour. A key class of games is the social dilemmas, where cooperation benefits the group but defection benefits the individual within any group. Previous works have considered which games qualify as social dilemmas, and different categories of dilemmas, but have generally concentrated on fixed sizes of interacting groups. In this paper, we develop a systematic investigation of social dilemmas on all group sizes. This allows for a richer definition of social dilemmas. For example, while increasing a group size to include another defector is always bad for all existing group members, extra cooperators can be good or bad, depending upon the particular dilemma and group size. We consider a number of commonly used social dilemmas in this context and in particular show the effect of variability in group sizes for the example of a population comprising negative binomially distributed group sizes. The most striking effect is that increasing the variability in group sizes for non-threshold public goods games is favourable for the evolution of cooperation. The situation for threshold public goods games and commons dilemmas is more complex.

Evolutionary dynamics and the evolution of multiplayer cooperation in a subdivided population

The classical models of evolution have been developed to incorporate structured populations using evolutionary graph theory and, more recently, a new framework has been developed to allow for more flexible population structures which potentially change through time and can accommodate multiplayer games with variable group sizes. In this paper we extend this work in three key ways. Firstly by developing a complete set of evolutionary dynamics so that the range of dynamic processes used in classical evolutionary graph theory can be applied. Secondly, by building upon previous models to allow for a general subpopulation structure, where all subpopulation members have a common movement distribution. Subpopulations can have varying levels of stability, represented by the proportion of interactions occurring between subpopulation members; in our representation of the population all subpopulation members are represented by a single vertex. In conjunction with this we extend the important concept of temperature (the temperature of a vertex is the sum of all the weights coming into that vertex; generally, the higher the temperature, the higher the rate of turnover of individuals at a vertex). Finally, we have used these new developments to consider the evolution of cooperation in a class of populations which possess this subpopulation structure using a multiplayer public goods game. We show that cooperation can evolve providing that subpopulations are sufficiently stable, with the smaller the subpopulations the easier it is for cooperation to evolve. We introduce a new concept of temperature, namely "subgroup temperature", which can be used to explain our results.

Which facilitates the evolution of cooperation more, retaliation or persistence?

The existence of cooperation in this world is a mysterious phenomenon. One of the mechanisms that explain the evolution of cooperation is repeated interaction. If interactions between the same individuals repeat and individuals cooperate conditionally, cooperation can evolve. A previous study pointed out that if individuals have persistence (i.e., imitate its "own" behavior in the last move), cooperation can evolve. However, retaliation and persistence are not mutually exclusive decisions, but rather a trade-off in the decision making process of individuals. Players can refer to the opponent's behavior and if the actor and the opponent opted for the different alternative in the last move, conditional cooperators have to give up either retaliation or persistence. The previous study also investigated this, and has revealed that the individual should give more importance to retaliation than to persistence. However, this study has assumed that the errors in perception are absent. In this world, errors in perception are present, and trying to imitate the opponent player can sometimes end in failure. And, it might be that imitating the focal player, which definitely ends in success, is more beneficial than trying to imitate the opponent player, which can end in failure especially when the error rate in recognition is large. Here, this paper uses evolutionarily stable strategy (ESS) analysis and analyzes the stability for reactive strategies against the invasion by unconditional defectors in the iterated prisoner's dilemma game. And our analysis reveals that even if we take errors in perception into consideration, retaliation facilitates the evolution of cooperation more than persistence unexpectedly. In addition, we analyze the stability for reactive cooperators against the invasion by a strategy other than unconditional defectors. Moreover, we also analyze the deterministic model in which unconditional cooperators, unconditional defectors, and the reactive strategy at the same time.

Ordering structured populations in multiplayer cooperation games

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 is greater than population structure in the containment or the volume order, then 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.

Unified and simple understanding for the evolution of conditional cooperators

Cooperation is a mysterious phenomenon which is observed in this world. The potential explanation is a repeated interaction. Cooperation is established if individuals meet the same opponent repeatedly and cooperate conditionally. Previous studies have analyzed the following four as characters of conditional cooperators mainly. (i) niceness (i.e., when a conditional cooperator meets an opponent in the first place, he (she) cooperates or defects), (ii) optimism (when a conditional cooperator meets an opponent in the past, but he (she) did not get access to information about the opponent's behavior in the previous round, he (she) cooperates or defects), (iii) generosity (even when a conditional cooperator knows that an opponent defected in the previous round, he (she) cooperates or defects) and (iv) retaliation (a conditional cooperator cooperates with a cooperator with a higher probability than with a defector). Previous works deal with these four characters mainly. However, these four characters basically have been regarded as distinct topics and unified understanding has not been done fully. Here we, by studying the iterated prisoner's dilemma game (in particular, additive games) and using evolutionarily stable strategy (ESS) analysis, find that when retaliation is large, the condition under which conditional cooperators are stable against the invasion by an unconditional defector is loose, while none of "niceness", "optimism", and "generosity" makes impact on the condition under which conditional cooperators are stable against an invasion by an unconditional defector. Furthermore, we show that we can understand "niceness", "optimism", and "generosity" uniformly by using one parameter indicating "cooperative", and when the conditional cooperators have large "retaliation" enough to resist an invasion by an unconditional defector, natural selection favors more "cooperative" conditional cooperators to invade the resident conditional cooperative strategy. Moreover, we show that these results are robust even when taking the existence of mistakes in behavior into consideration.

Hamilton's rule

This paper reviews and addresses a variety of issues relating to inclusive fitness. The main question is: are there limits to the generality of inclusive fitness, and if so, what are the perimeters of the domain within which inclusive fitness works? This question is addressed using two well-known tools from evolutionary theory: the replicator dynamics, and adaptive dynamics. Both are combined with population structure. How generally Hamilton's rule applies depends on how costs and benefits are defined. We therefore consider costs and benefits following from Karlin and Matessi's (1983) "counterfactual method", and costs and benefits as defined by the "regression method" (Gardner et al., 2011). With the latter definition of costs and benefits, Hamilton's rule always indicates the direction of selection correctly, and with the former it does not. How these two definitions can meaningfully be interpreted is also discussed. We also consider cases where the qualitative claim that relatedness fosters cooperation holds, even if Hamilton's rule as a quantitative prediction does not. We furthermore find out what the relation is between Hamilton's rule and Fisher's Fundamental Theorem of Natural Selection. We also consider cancellation effects - which is the most important deepening of our understanding of when altruism is selected for. Finally we also explore the remarkable (im)possibilities for empirical testing with either definition of costs and benefits in Hamilton's rule.

Evolutionary Games of Multiplayer Cooperation on Graphs

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.

Cooperation can be defined as the act of providing fitness benefits to other individuals, often at a personal cost. When interactions occur mainly with neighbors, assortment of strategies can favor cooperation but local competition can undermine it. Previous research has shown that a single coefficient can capture this trade-off when cooperative interactions take place between two players. More complicated, but also more realistic, models of cooperative interactions involving multiple players instead require several such coefficients, making it difficult to assess the effects of population structure. Here, we obtain analytical approximations for the coefficients of multiplayer games in graph-structured populations. Computer simulations show that, for particular instances of multiplayer games, these approximate coefficients predict the condition for cooperation to be promoted in random graphs well, but fail to do so in graphs with more structure, such as lattices. Our work extends and generalizes established results on the evolution of cooperation on graphs, but also highlights the importance of explicitly taking into account higher-order statistical associations in order to assess the evolutionary dynamics of cooperation in spatially structured populations.

Evolutionary dynamics of general group interactions in structured populations

The evolution of populations is influenced by many factors, and the simple classical models have been developed in a number of important ways. Both population structure and multiplayer interactions have been shown to significantly affect the evolution of important properties, such as the level of cooperation or of aggressive behavior. Here we combine these two key factors and develop the evolutionary dynamics of general group interactions in structured populations represented by regular graphs. The traditional linear and threshold public goods games are adopted as models to address the dynamics. We show that for linear group interactions, population structure can favor the evolution of cooperation compared to the well-mixed case, and we see that the more neighbors there are, the harder it is for cooperators to persist in structured populations. We further show that threshold group interactions could lead to the emergence of cooperation even in well-mixed populations. Here population structure sometimes inhibits cooperation for the threshold public goods game, where depending on the benefit to cost ratio, the outcomes are bistability or a monomorphic population of defectors or cooperators. Our results suggest, counterintuitively, that structured populations are not always beneficial for the evolution of cooperation for nonlinear group interactions.

Evolutionary performance of zero-determinant strategies in multiplayer games

Repetition is one of the key mechanisms to maintain cooperation. In long-term relationships, in which individuals can react to their peers׳ past actions, evolution can promote cooperative strategies that would not be stable in one-shot encounters. The iterated prisoner׳s dilemma illustrates the power of repetition. Many of the key strategies for this game, such as ALLD, ALLC, Tit-for-Tat, or generous Tit-for-Tat, share a common property: players using these strategies enforce a linear relationship between their own payoff and their co-player׳s payoff. Such strategies have been termed zero-determinant (ZD). Recently, it was shown that ZD strategies also exist for multiplayer social dilemmas, and here we explore their evolutionary performance. For small group sizes, ZD strategies play a similar role as for the repeated prisoner׳s dilemma: extortionate ZD strategies are critical for the emergence of cooperation, whereas generous ZD strategies are important to maintain cooperation. In large groups, however, generous strategies tend to become unstable and selfish behaviors gain the upper hand. Our results suggest that repeated interactions alone are not sufficient to maintain large-scale cooperation. Instead, large groups require further mechanisms to sustain cooperation, such as the formation of alliances or institutions, or additional pairwise interactions between group members.

Structure coefficients and strategy selection in multiplayer games

Evolutionary processes based on two-player games such as the Prisoner's Dilemma or Snowdrift Game are abundant in evolutionary game theory. These processes, including those based on games with more than two strategies, have been studied extensively under the assumption that selection is weak. However, games involving more than two players have not received the same level of attention. To address this issue, and to relate two-player games to multiplayer games, we introduce a notion of reducibility for multiplayer games that captures what it means to break down a multiplayer game into a sequence of interactions with fewer players. We discuss the role of reducibility in structured populations, and we give examples of games that are irreducible in any population structure. Since the known conditions for strategy selection, otherwise known as [Formula: see text]-rules, have been established only for two-player games with multiple strategies and for multiplayer games with two strategies, we extend these rules to multiplayer games with many strategies to account for irreducible games that cannot be reduced to those simpler types of games. In particular, we show that the number of structure coefficients required for a symmetric game with [Formula: see text]-player interactions and [Formula: see text] strategies grows in [Formula: see text] like [Formula: see text]. Our results also cover a type of ecologically asymmetric game based on payoff values that are derived not only from the strategies of the players, but also from their spatial positions within the population.

Phase transitions in a coevolving snowdrift game with costly rewiring

We propose and study a dissatisfied adaptive snowdrift game with a payoff parameter r that incorporates a cost for rewiring a connection. An agent, facing adverse local environment, may switch action without a cost or rewire an existing link with a cost a so as to attain a better competing environment. Detailed numerical simulations reveal nontrivial and nonmonotonic dependence of the frequency of cooperation and the densities of different types of links on a and r. A theory that treats the cooperative and noncooperative agents separately and accounts for spatial correlation up to neighboring agents is formulated. The theory gives results that are in good agreement with simulations. The frequency of cooperation f_{C} is enhanced (suppressed) at high rewiring cost relative to that at low rewiring cost when r is small (large). For a given value of r, there exists a critical value of the rewiring cost below which the system evolves into a phase of frozen dynamics with isolated noncooperative agents segregated from a cluster of cooperative agents, and above which the system evolves into a connected population of mixed actions with continual dynamics. The phase boundary on the a-r phase space that separates the two phases with distinct structural, population and dynamical properties is mapped out. The phase diagram reveals that, as a general feature, for small r (small a), the disconnected and segregated phase can survive over a wider range of a(r).

Cooperation with both synergistic and local interactions can be worse than each alone

Cooperation is ubiquitous ranging from multicellular organisms to human societies. Population structures indicating individuals' limited interaction ranges are crucial to understand this issue. But it remains unknown to what extend multiple interactions involving nonlinearity in payoff influence the cooperation in structured populations. Here we show a rule, which determines the emergence and stabilization of cooperation, under multiple discounted, linear, and synergistic interactions. The rule is validated by simulations in homogenous and heterogenous structured populations. We find that the more neighbours there are the harder for cooperation to evolve for multiple interactions with linearity and discounting. For synergistic scenario, however, distinct from its pairwise counterpart, moderate number of neighbours can be the worst, indicating that synergistic interactions work with strangers but not with neighbours. Our results suggest that the combination of different factors which promotes cooperation alone can be worse than that with every single factor.

Optional games on cycles and complete graphs

We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition, there are one or several possibilities to opt out from the game by adopting loner strategies. Optional games lead to relaxed social dilemmas. Here we explore the interaction between spatial structure and optional games. We find that increasing the number of loner strategies (or equivalently increasing mutational bias toward loner strategies) facilitates evolution of cooperation both in well-mixed and in structured populations. We derive various limits for weak selection and large population size. For some cases we derive analytic results for strong selection. We also analyze strategy selection numerically for finite selection intensity and discuss combined effects of optionality and spatial structure.

Global migration can lead to stronger spatial selection than local migration

The outcome of evolutionary processes depends on population structure. It is well known that mobility plays an important role in affecting evolutionary dynamics in group structured populations. But it is largely unknown whether global or local migration leads to stronger spatial selection and would therefore favor to a larger extent the evolution of cooperation. To address this issue, we quantify the impacts of these two migration patterns on the evolutionary competition of two strategies in a finite island model. Global migration means that individuals can migrate from any one island to any other island. Local migration means that individuals can only migrate between islands that are nearest neighbors; we study a simple geometry where islands are arranged on a one-dimensional, regular cycle. We derive general results for weak selection and large population size. Our key parameters are: the number of islands, the migration rate and the mutation rate. Surprisingly, our comparative analysis reveals that global migration can lead to stronger spatial selection than local migration for a wide range of parameter conditions. Our work provides useful insights into understanding how different mobility patterns affect evolutionary processes.

Evolutionary construction by staying together and coming together

The evolutionary trajectory of life on earth is one of increasing size and complexity. Yet the standard equations of evolutionary dynamics describe mutation and selection among similar organisms that compete on the same level of organization. Here we begin to outline a mathematical theory that might help to explore how evolution can be constructive, how natural selection can lead from lower to higher levels of organization. We distinguish two fundamental operations, which we call 'staying together' and 'coming together'. Staying together means that individuals form larger units by not separating after reproduction, while coming together means that independent individuals form aggregates. Staying together can lead to specialization and division of labor, but the developmental program must evolve in the basic unit. Coming together can be creative by combining units with different properties. Both operations have been identified in the context of multicellularity, but they have been treated very similarly. Here we point out that staying together and coming together can be found at every level of biological construction and moreover that they face different evolutionary problems. The distinction is particularly clear in the context of cooperation and defection. For staying together the stability of cooperation takes the form of a developmental error threshold, while coming together leads to evolutionary games and requires a mechanism for the evolution of cooperation. We use our models to discuss simple aspects of the evolution of protocells, eukarya, multi-cellularity and animal societies.

Evolutionary shift dynamics on a cycle

We present a new model of evolutionary dynamics in one-dimensional space. Individuals are arranged on a cycle. When a new offspring is born, another individual dies and the rest shift around the cycle to make room. This rule, which is inspired by spatial evolution in somatic tissue and microbial colonies, has the remarkable property that, in the limit of large population size, evolution acts to maximize the payoff of the whole population. Therefore, social dilemmas, in which some individuals benefit at the expense of others, are resolved. We demonstrate this principle for both discrete and continuous games. We also discuss extensions of our model to other one-dimensional spatial configurations. We conclude that shift dynamics in one dimension is an unusually strong promoter of cooperative behavior.

A general framework for analysing multiplayer games in networks using territorial interactions as a case study

Recently, models of evolution have begun to incorporate structured populations, including spatial structure, through the modelling of evolutionary processes on graphs (evolutionary graph theory). One limitation of this otherwise quite general framework is that interactions are restricted to pairwise ones, through the edges connecting pairs of individuals. Yet, many animal interactions can involve many players, and theoretical models also describe such multiplayer interactions. We shall discuss a more general modelling framework of interactions of structured populations with the focus on competition between territorial animals, where each animal or animal group has a "home range" which overlaps with a number of others, and interactions between various group sizes are possible. Depending upon the behaviour concerned we can embed the results of different evolutionary games within our structure, as occurs for pairwise games such as the Prisoner's Dilemma or the Hawk-Dove game on graphs. We discuss some examples together with some important differences between this approach and evolutionary graph theory.

Group-size diversity in public goods games

Public goods games are models of social dilemmas where cooperators pay a cost for the production of a public good while defectors free ride on the contributions of cooperators. In the traditional framework of evolutionary game theory, the payoffs of cooperators and defectors result from interactions in groups formed by binomial sampling from an infinite population. Despite empirical evidence showing that group-size distributions in nature are highly heterogeneous, most models of social evolution assume that the group size is constant. In this article, I remove this assumption and explore the effects of having random group sizes on the evolutionary dynamics of public goods games. By a straightforward application of Jensen's inequality, I show that the outcome of general nonlinear public goods games depends not only on the average group size but also on the variance of the group-size distribution. This general result is illustrated with two nonlinear public goods games (the public goods game with discounting or synergy and the N-person volunteer's dilemma) and three different group-size distributions (Poisson, geometric, and Waring). The results suggest that failing to acknowledge the natural variation of group sizes can lead to an underestimation of the actual level of cooperation exhibited in evolving populations.