The Evolution of Cooperation in One-Dimensional Mobile Populations with Deterministic Dispersal

Network topology and movement cost, not updating mechanism, determine the evolution of cooperation in mobile structured populations

Evolutionary models are used to study the self-organisation of collective action, often incorporating population structure due to its ubiquitous presence and long-known impact on emerging phenomena. We investigate the evolution of multiplayer cooperation in mobile structured populations, where individuals move strategically on networks and interact with those they meet in groups of variable size. We find that the evolution of multiplayer cooperation primarily depends on the network topology and movement cost while using different stochastic update rules seldom influences evolutionary outcomes. Cooperation robustly co-evolves with movement on complete networks and structure has a partially detrimental effect on it. These findings contrast an established principle from evolutionary graph theory that cooperation can only emerge under some update rules and if the average degree is lower than the reward-to-cost ratio and the network far from complete. We find that group-dependent movement erases the locality of interactions, suppresses the impact of evolutionary structural viscosity on the fitness of individuals, and leads to assortative behaviour that is much more powerful than viscosity in promoting cooperation. We analyse the differences remaining between update rules through a comparison of evolutionary outcomes and fixation probabilities.

The Evolution of Cooperation in Two-Dimensional Mobile Populations with Random and Strategic Dispersal

We investigate the effect of the environment dimensionality and different dispersal strategies on the evolution of cooperation in a finite structured population of mobile individuals. We consider a population consisting of cooperators and free-riders residing on a two-dimensional lattice with periodic boundaries. Individuals explore the environment according to one of the four dispersal strategies and interact with each other via a public goods game. The population evolves according to a birth–death–birth process with the fitness of the individuals deriving from the game-induced payouts. We found that the outcomes of the strategic dispersal strategies in the two-dimensional setting are identical to the outcomes in the one-dimensional setting. The random dispersal strategy, not surprisingly, resulted in the worst outcome for cooperators.

Temporal assortment of cooperators in the spatial prisoner's dilemma

We study a spatial, one-shot prisoner's dilemma (PD) model in which selection operates on both an organism's behavioral strategy (cooperate or defect) and its decision of when to implement that strategy, which we depict as an organism's choice of one point in time, out of a set of discrete time slots, at which to carry out its PD strategy. Results indicate selection for cooperators across various time slots and parameter settings, including parameter settings in which cooperation would not evolve in an exclusively spatial model-as in work investigating exogenously imposed temporal networks. Moreover, in the presence of time slots, cooperators' portion of the population grows even under different combinations of spatial structure, transition rules, and update dynamics, though rates of cooperator fixation decline under pairwise comparison and synchronous updating. These findings indicate that, under certain evolutionary processes, merely existing in time and space promotes the evolution of cooperation.

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.