American Institute of Mathematical Sciences

July  2018, 23(5): 1975-2004. doi: 10.3934/dcdsb.2018191

Evolving multiplayer networks: Modelling the evolution of cooperation in a mobile population

 1 Department of Mathematics, City, University of London, 10 Northampton Square, London, EC1V 0HB, UK 2 Department of Mathematics and Statistics, The University of North Carolina at Greensboro, Greensboro, NC 27412, USA

* Corresponding author: Karan Pattni (karan.pattni.1@city.ac.uk).

Received  February 2017 Revised  May 2017 Published  May 2018

We consider a finite population of individuals that can move through a structured environment using our previously developed flexible evolutionary framework. In the current paper the behaviour of the individuals follows a Markov movement model where decisions about whether they should stay or leave depends upon the group of individuals they are with at present. The interaction between individuals is modelled using a public goods game. We demonstrate that cooperation can evolve when there is a cost associated with movement. Combining the movement cost with a larger population size has a positive effect on the evolution of cooperation. Moreover, increasing the exploration time, which is the amount of time an individual is allowed to explore its environment, also has a positive effect. Unusually, we find that the evolutionary dynamics used does not have a significant effect on these results.

Citation: Karan Pattni, Mark Broom, Jan Rychtář. Evolving multiplayer networks: Modelling the evolution of cooperation in a mobile population. Discrete & Continuous Dynamical Systems - B, 2018, 23 (5) : 1975-2004. doi: 10.3934/dcdsb.2018191
References:

show all references

References:
This plot shows the best response staying propensities for 1 type $C_i$ individual playing against $N-1$ type $C_j$ individuals. Parameter set 1 is used with $\lambda = 0.2$ and $i, j\in \{0.01, 0.02, \ldots, 0.99\}$. The intersection point of the plots gives the unique strategy which is a best response to itself, i.e. the unique cooperator resident Nash equilibrium staying propensity $\gamma_R$, which is somewhere between $0.3$ and $0.4$. This value is similar to the one obtained using the iterative method (see Figure 2). The values from the current figure are approximate only because of the jagged nature of the lines; these occur because of the very large number of simulations that would be necessary to obtain a smooth version (the figure uses 10000 simulations for each combination). The figure is used to illustrate the uniqueness of the solution only.
These plots show the effect of movement cost on the evolution of cooperation using parameter set 1. The left (centre) plot shows the staying propensities $\delta_R = 0.99$ ($\gamma_R$) for resident defectors (cooperators) and $\gamma_M$ ($\delta_M$) for a mutant cooperator (defector) used to invade the resident population. In the right plot, we have the fixation probability of a mutant cooperator $C_{\gamma_M}$ (defector $D_{\delta_M}$) against $N-1$ resident defectors $D_{0.99}$ (cooperators $C_{\gamma_R}$).
Plots created using parameter set 2. The exploration time $T$ has been decreased from 10 to 5.
Plots created using parameter set 3. The exploration time $T$ has been increased from 10 to 25.
Plots created using parameter set 4. The population size has been increased from 10 to 20.
Plots have been created using parameter set 5. The plots here are against the reward to cost ratio $v/c$ such that $c = 0.04.$
Plots have been created using parameter set 6. The plots here are against the reward to cost ratio $v/c$ such that $c = 0.09$.
This plot shows the best response cooperator staying propensity (solid line, value shown on the x-axis) versus the range of defector staying propensities on the y-axis, and the best response defector staying propensity (dashed line, value shown on the y-axis) versus the range of cooperator staying propensities (on the x-axis) for $N/2$ cooperators and $N/2$ defectors. Parameter set 1 is used with $\lambda = 0.2$ and the staying propensities are chosen from the set $\{0.01, 0.02, \ldots, 0.99\}$. The best response staying propensities cross at one point only, which is thus the unique Nash equilibrium, where $\gamma\approx 0.7$ and $\delta\approx0.5$. These values are similar to those obtained using the iterative method described earlier (see Figure 9). As before, the values from the current figure are approximate only because of the jagged nature of the lines; the figure is used to illustrate the uniqueness of the solution only.
These plots show the effect of movement cost $\lambda$ on the evolution of cooperation and are created using parameter set 1. The plot on the left shows the Nash equilibrium staying propensity $\gamma$ for cooperators and $\delta$ for defectors in a mixed population where there are $N/2$ individuals of each type. The plot in the centre shows the fixation probability of each type from the mixed state with $N/2$ individuals of each type. The plot on the right shows the fixation probability of a mutant cooperator $C_\gamma$ (defector $D_\delta$) in a population of $N-1$ resident defectors $D_\delta$ (cooperators $C_\gamma$).
Plots created using parameter set 2. Plots are as in Figure 9 with exploration time $T$ decreased from $10$ to $5$.
Plots created using parameter set 3. Plots are as in Figure 9 with exploration time $T$ increased from $10$ to $25$.
Plots created using parameter set 4. Plots are as in Figure 9 with population size $N$ increased from $10$ to $20$.
Plots created using parameter set 5. Plots are as in Figure 9 but $\lambda$ is fixed and reward to cost ratio $v/c$ varied such that $c = 0.04$.
Plots created using parameter set 5. Plots are as in Figure 9 but $\lambda$ is fixed and reward to cost ratio $v/c$ varied such that $c = 0.09$.
Notation used in the paper.
 Table of Notation Notation Definition Description $N$ $\in \mathbb{Z}^+$ Population size. $M$ $\in \mathbb{Z}^+$ Number of places. $I_n$ Individual $n$. $P_m$ Place $m$. $m_{n, t}$ $\in\{1, \ldots, M\}$ Place where $I_n$ is at time $t$. ${\bf{m}}_t$ $= [m_{n, t}]_{n = 1}^N$ Population distribution at time $t$. ${\bf{m}}_{0$ Fitness of $I_n$ at time $t$. $\mathcal{G}_{n}$ $\subset\{1, 2\ldots, N\}$ Direct group: group that $I_n$ is in. $w_{i, j, t}$ $\ge 0$ Replacement weight that $I_i$ replaces $I_j$ at time $t$. ${\bf{W}}_t$ $= [w_{i, j, t}]_{i, j = 1, \ldots, N}$ Weighted adjacency matrix of evolutionary graph. $u_{i, j, t}$ $\ge 0$ Replacement weight contribution that $I_i$ assigns to $I_j$ at time $t$. $A, B$ Two types of individuals in the population. $\mathcal{S}$ $\subset\{1, 2, \ldots, N\}$ Population state, $n\in \mathcal{S}$ if $I_n$ has type $A$. $\mathcal{N}$ $= \{1, 2, \ldots, N\}$ State consisting of all type $A$ individuals. $P_{\mathcal{S}\mathcal{S}'}$ $\in [0, 1]$ Probability of transitioning from $\mathcal{S}$ to $\mathcal{S}'$. $\rho^A_\mathcal{S}$ $\in[0, 1]$ Fixation probability of type $A$ when the initial state is $\mathcal{S}$. $\mathfrak{r}_{ij}$ $\in [0, 1]$ Probability that $I_i$ replaces $I_j$. $h_n$ $\in [0, 1]$ Probability that $I_n$ stays. $\alpha_n$ $\in[0, 1]$ Staying propensity: probability that individual $I_n$ stays when alone. $C\ (D)$ Cooperator and defector interactive strategy. $\beta_C\ (\beta_D)$ $\in \mathbb{R}$ Benefit of being with a cooperator (defector). $S$ $\in (0, 1)$ Sensitivity shown to group members. $v$ $>0$ Reward as a multiple of background fitness. $c$ $\in [0, 1)$ Cost as a multiple of background fitness. $R_{n}$ $\ge 0$ Payoff to $I_n$. $\lambda$ $\in [0, \min(R_n))$ Movement cost. $T$ $\in \mathbb{Z}^+$ Exploration time. $C_\alpha\ (D_\alpha)$ Cooperator (defector) with staying propensity $\alpha$. $\gamma\ (\delta)$ $\in[0, 1]$ Nash equilibrium staying propensity of cooperator (defector).
 Table of Notation Notation Definition Description $N$ $\in \mathbb{Z}^+$ Population size. $M$ $\in \mathbb{Z}^+$ Number of places. $I_n$ Individual $n$. $P_m$ Place $m$. $m_{n, t}$ $\in\{1, \ldots, M\}$ Place where $I_n$ is at time $t$. ${\bf{m}}_t$ $= [m_{n, t}]_{n = 1}^N$ Population distribution at time $t$. ${\bf{m}}_{0$ Fitness of $I_n$ at time $t$. $\mathcal{G}_{n}$ $\subset\{1, 2\ldots, N\}$ Direct group: group that $I_n$ is in. $w_{i, j, t}$ $\ge 0$ Replacement weight that $I_i$ replaces $I_j$ at time $t$. ${\bf{W}}_t$ $= [w_{i, j, t}]_{i, j = 1, \ldots, N}$ Weighted adjacency matrix of evolutionary graph. $u_{i, j, t}$ $\ge 0$ Replacement weight contribution that $I_i$ assigns to $I_j$ at time $t$. $A, B$ Two types of individuals in the population. $\mathcal{S}$ $\subset\{1, 2, \ldots, N\}$ Population state, $n\in \mathcal{S}$ if $I_n$ has type $A$. $\mathcal{N}$ $= \{1, 2, \ldots, N\}$ State consisting of all type $A$ individuals. $P_{\mathcal{S}\mathcal{S}'}$ $\in [0, 1]$ Probability of transitioning from $\mathcal{S}$ to $\mathcal{S}'$. $\rho^A_\mathcal{S}$ $\in[0, 1]$ Fixation probability of type $A$ when the initial state is $\mathcal{S}$. $\mathfrak{r}_{ij}$ $\in [0, 1]$ Probability that $I_i$ replaces $I_j$. $h_n$ $\in [0, 1]$ Probability that $I_n$ stays. $\alpha_n$ $\in[0, 1]$ Staying propensity: probability that individual $I_n$ stays when alone. $C\ (D)$ Cooperator and defector interactive strategy. $\beta_C\ (\beta_D)$ $\in \mathbb{R}$ Benefit of being with a cooperator (defector). $S$ $\in (0, 1)$ Sensitivity shown to group members. $v$ $>0$ Reward as a multiple of background fitness. $c$ $\in [0, 1)$ Cost as a multiple of background fitness. $R_{n}$ $\ge 0$ Payoff to $I_n$. $\lambda$ $\in [0, \min(R_n))$ Movement cost. $T$ $\in \mathbb{Z}^+$ Exploration time. $C_\alpha\ (D_\alpha)$ Cooperator (defector) with staying propensity $\alpha$. $\gamma\ (\delta)$ $\in[0, 1]$ Nash equilibrium staying propensity of cooperator (defector).
Dynamics defined using the replacement weights and fitnesses as in [45]. In each case, B (D) is appended to the name of the dynamics if selection happens in the birth (death) event. For BDB and BDD dynamics $\mathfrak{r}_{ij} = b_{i}d_{ij}$, for DBD and DBB dynamics $\mathfrak{r}_{ij} = d_{j}b_{ij}$.
 Dynamics BDB $\displaystyle b_i = \frac{ F_i }{\sum_{n} F_n }, \ d_{ij}= \frac{w_{ij} }{\sum_{n} w_{in} }$ BDD $\displaystyle b_i= \frac{1}{N}, \ d_{ij}= \frac{ w_{ij}F_j^{-1} }{\sum_{n} w_{in}F_n^{-1} }$ DBD $\displaystyle d_j= \frac{ F_j^{-1}}{ \sum_{n} F_n^{-1} }, \ b_{ij}= \frac{ w_{ij} }{\sum_{n} w_{nj} }$ DBB $\displaystyle d_j= \frac{ 1 }{ N }, \ b_{ij}= \frac{ w_{ij}F_i }{\sum_{n} w_{nj}F_n }$ LB $\displaystyle\mathfrak{r}_{ij} =\frac{ w_{ij}F_i}{\sum_{n, k} w_{nk} F_n}$ LD $\displaystyle \mathfrak{r}_{ij} =\frac{ w_{ij}F_j^{-1} }{\sum_{n, k} w_{nk} F_k^{-1} }$
 Dynamics BDB $\displaystyle b_i = \frac{ F_i }{\sum_{n} F_n }, \ d_{ij}= \frac{w_{ij} }{\sum_{n} w_{in} }$ BDD $\displaystyle b_i= \frac{1}{N}, \ d_{ij}= \frac{ w_{ij}F_j^{-1} }{\sum_{n} w_{in}F_n^{-1} }$ DBD $\displaystyle d_j= \frac{ F_j^{-1}}{ \sum_{n} F_n^{-1} }, \ b_{ij}= \frac{ w_{ij} }{\sum_{n} w_{nj} }$ DBB $\displaystyle d_j= \frac{ 1 }{ N }, \ b_{ij}= \frac{ w_{ij}F_i }{\sum_{n} w_{nj}F_n }$ LB $\displaystyle\mathfrak{r}_{ij} =\frac{ w_{ij}F_i}{\sum_{n, k} w_{nk} F_n}$ LD $\displaystyle \mathfrak{r}_{ij} =\frac{ w_{ij}F_j^{-1} }{\sum_{n, k} w_{nk} F_k^{-1} }$
Parameters used for the simulations. The other parameters are fixed such that we have a complete structure with each individual having its own home, $\beta_C = 1$, $\beta_D = -1$, $S = 0.03$ and the dynamics used are BDB.
 Parameter Set 1 2 3 4 5 6 $N$ 10 10 10 20 10 10 $T$ 10 5 25 10 10 10 $\lambda$ Variable Variable Variable Variable 0.20 0.20 $c$ 0.04 0.04 0.04 0.04 0.04 0.09 $v$ 0.40 0.40 0.40 0.4 Variable Variable
 Parameter Set 1 2 3 4 5 6 $N$ 10 10 10 20 10 10 $T$ 10 5 25 10 10 10 $\lambda$ Variable Variable Variable Variable 0.20 0.20 $c$ 0.04 0.04 0.04 0.04 0.04 0.09 $v$ 0.40 0.40 0.40 0.4 Variable Variable
 [1] Astridh Boccabella, Roberto Natalini, Lorenzo Pareschi. On a continuous mixed strategies model for evolutionary game theory. Kinetic & Related Models, 2011, 4 (1) : 187-213. doi: 10.3934/krm.2011.4.187 [2] Anna Lisa Amadori, Astridh Boccabella, Roberto Natalini. A hyperbolic model of spatial evolutionary game theory. Communications on Pure & Applied Analysis, 2012, 11 (3) : 981-1002. doi: 10.3934/cpaa.2012.11.981 [3] King-Yeung Lam. Dirac-concentrations in an integro-pde model from evolutionary game theory. Discrete & Continuous Dynamical Systems - B, 2019, 24 (2) : 737-754. doi: 10.3934/dcdsb.2018205 [4] Scott G. McCalla. Paladins as predators: Invasive waves in a spatial evolutionary adversarial game. Discrete & Continuous Dynamical Systems - B, 2014, 19 (5) : 1437-1457. doi: 10.3934/dcdsb.2014.19.1437 [5] William H. Sandholm. Local stability of strict equilibria under evolutionary game dynamics. Journal of Dynamics & Games, 2014, 1 (3) : 485-495. doi: 10.3934/jdg.2014.1.485 [6] John Cleveland. Basic stage structure measure valued evolutionary game model. Mathematical Biosciences & Engineering, 2015, 12 (2) : 291-310. doi: 10.3934/mbe.2015.12.291 [7] Hassan Najafi Alishah, Pedro Duarte. Hamiltonian evolutionary games. Journal of Dynamics & Games, 2015, 2 (1) : 33-49. doi: 10.3934/jdg.2015.2.33 [8] Shui-Nee Chow, Kening Lu, Yun-Qiu Shen. Normal forms for quasiperiodic evolutionary equations. Discrete & Continuous Dynamical Systems - A, 1996, 2 (1) : 65-94. doi: 10.3934/dcds.1996.2.65 [9] Alexey Cheskidov, Landon Kavlie. Pullback attractors for generalized evolutionary systems. Discrete & Continuous Dynamical Systems - B, 2015, 20 (3) : 749-779. doi: 10.3934/dcdsb.2015.20.749 [10] Andrzej Swierniak, Michal Krzeslak. Application of evolutionary games to modeling carcinogenesis. Mathematical Biosciences & Engineering, 2013, 10 (3) : 873-911. doi: 10.3934/mbe.2013.10.873 [11] Stamatios Katsikas, Vassilli Kolokoltsov. Evolutionary, mean-field and pressure-resistance game modelling of networks security. Journal of Dynamics & Games, 2019, 6 (4) : 315-335. doi: 10.3934/jdg.2019021 [12] Minette Herrera, Aaron Miller, Joel Nishimura. Altruistic aging: The evolutionary dynamics balancing longevity and evolvability. Mathematical Biosciences & Engineering, 2017, 14 (2) : 455-465. doi: 10.3934/mbe.2017028 [13] Jim M. Cushing. The evolutionary dynamics of a population model with a strong Allee effect. Mathematical Biosciences & Engineering, 2015, 12 (4) : 643-660. doi: 10.3934/mbe.2015.12.643 [14] Jeremias Epperlein, Vladimír Švígler. On arbitrarily long periodic orbits of evolutionary games on graphs. Discrete & Continuous Dynamical Systems - B, 2018, 23 (5) : 1895-1915. doi: 10.3934/dcdsb.2018187 [15] Amy Veprauskas, J. M. Cushing. Evolutionary dynamics of a multi-trait semelparous model. Discrete & Continuous Dynamical Systems - B, 2016, 21 (2) : 655-676. doi: 10.3934/dcdsb.2016.21.655 [16] Jinyuan Zhang, Aimin Zhou, Guixu Zhang, Hu Zhang. A clustering based mate selection for evolutionary optimization. Big Data & Information Analytics, 2017, 2 (1) : 77-85. doi: 10.3934/bdia.2017010 [17] Caichun Chai, Tiaojun Xiao, Eilin Francis. Is social responsibility for firms competing on quantity evolutionary stable?. Journal of Industrial & Management Optimization, 2018, 14 (1) : 325-347. doi: 10.3934/jimo.2017049 [18] Siegfried Carl. Comparison results for a class of quasilinear evolutionary hemivariational inequalities. Conference Publications, 2007, 2007 (Special) : 221-229. doi: 10.3934/proc.2007.2007.221 [19] Alexander Mielke. Deriving amplitude equations via evolutionary $\Gamma$-convergence. Discrete & Continuous Dynamical Systems - A, 2015, 35 (6) : 2679-2700. doi: 10.3934/dcds.2015.35.2679 [20] Tao Wu, Yu Lei, Jiao Shi, Maoguo Gong. An evolutionary multiobjective method for low-rank and sparse matrix decomposition. Big Data & Information Analytics, 2017, 2 (1) : 23-37. doi: 10.3934/bdia.2017006

2018 Impact Factor: 1.008