THE EVOLUTION OF COOPERATION IN 1-DIMENSIONAL MOBILE POPULATIONS

Size: px
Start display at page:

Download "THE EVOLUTION OF COOPERATION IN 1-DIMENSIONAL MOBILE POPULATIONS"

Transcription

1 Far East Journal of Applied Mathematics 2016 Pushpa Publishing House, Allahabad, India Published Online: August Volume 95, Number 1, 2016, Pages ISSN: THE EVOLUTION OF COOPERATION IN 1-DIMENSIONAL MOBILE POPULATIONS Department of Mathematics and Statistics University of North Carolina at Greensboro Greensboro NC U. S. A. Abstract We investigate the effects of spatial structure and mobility on the evolution of cooperation. We consider a finite fixed size population of mobile cooperators and free-riders. Cooperators provide benefits to all individuals in their vicinity at a cost to themselves, whereas free-riders do not provide any benefits and incur no cost. Individuals occupy positions in a 1-dimensional lattice and are allowed to move to try to maximize their payoff. Our model allows simultaneous interactions among multiple individuals as all individuals in a neighborhood compete for the same limited resource. We create an exact stochastic simulation of this Markov process and find that smaller neighborhood size, lower mobility and shorter migration range promote the fixation of cooperators in the population. On the other hand, sufficiently large migration range coupled with high mobility rate may result in breakdown of cooperation. Received: April 14, 2016; Accepted: June 1, Mathematics Subject Classification: Primary 91A22. Keywords and phrases: evolution of cooperation, spatial structure, mobility, stochastic simulation. Communicated by K. K. Azad

2 64 1. Introduction Understanding the emergence and persistence of cooperation is a fundamental problem in evolutionary biology. Cooperation is needed for the evolution of higher levels of organization. Genomes, cells, multicellular organisms and human society are all based on cooperation. The essence of cooperation lies in an individual paying a cost for someone to receive a benefit. Since evolution is based on competition between individuals, it should reward only selfish behavior as cooperators forgo some of their reproductive potential to help others. In an infinite well-mixed population, replicator dynamics shows that cooperators are doomed since noncooperators (also called defectors or free-riders) enjoy the benefits of cooperation but incur no cost. Yet cooperation abounds in nature and human society and one of the most remarkable aspects of evolution is its ability to generate and maintain cooperation in a competitive world. The evolution of cooperation is often studied in the context of evolutionary game theory [27, 13, 19] and one of the classical models for pairwise interactions between cooperators and defectors is the prisoner s dilemma. Potential benefits of cooperation alone are not sufficient for the evolutionary maintenance of cooperation since a population of cooperators is vulnerable to invasion by free-riders. Immense amount of research has been devoted to discovering and understanding additional mechanisms which help promote cooperation [5, 20]. One of the important observations is that real populations are not well-mixed since due to spatial structure or social networks, certain individuals interact more often than others. Since replicator dynamics neglects these circumstances, it has limited applicability to the study of the evolution of cooperation. Nowak and May [22] demonstrated that spatial structure, which allows cooperators to form clusters and to resist invasion of defectors, is one of the key mechanisms for the emergence and persistence of cooperation. The effect of spatial structure on the evolution of cooperation has been extensively studied [21, 18, 6, 23, 29, 25, 24] and it is usually found to be beneficial. On the other hand, there are also known instances when spatial structure inhibits cooperation [11].

3 Evolution of Cooperation in 1-dimensional Mobile Populations 65 Another key factor in studying the evolution of cooperation is mobility. This is motivated by the observation that individuals prefer better neighborhoods and are often willing to migrate to improve their situation. Once mobility is introduced into the mathematical model, the interaction structure constantly changes, and standard analytic models no longer apply. For the most accurate results, one usually employs agent-based stochastic simulations of the process. There are many different approaches to incorporating mobility into the mathematical model. Random diffusion [31, 26, 10, 15, 4, 30] may either promote or inhibit cooperation depending on parameters and rules of the model. Individuals may move if they are unhappy with their current interactions [1, 32] or if their payoff is lower than a certain threshold [17]. In reputation-based migration models, individuals move from low reputation neighborhoods [8]. Individuals may consider different alternative locations within their migration range and move to locations with better payoffs based on test interactions with individuals in possible new neighborhoods; such mobility model is called success-driven migration [12] (see also [7] for further elaboration on this model). It is also possible to incorporate mobility into the model implicitly by considering dynamic networks [3, 33]. There is no clear-cut effect of mobility on the evolution of cooperation. The outcome depends on the model used, and if spatial structure already promotes cooperation by allowing cooperators to thrive in clusters, then introducing mobility into the model often allows free-riders to exploit and breakdown these clusters. Also, it is possible to create conditions where roaming free-riders keep exploiting unsuspecting cooperators [9]. On the other hand, if spatial structure alone is not sufficient for emergence and persistence of cooperation, then introducing mobility may help cooperators aggregate in clusters, which is essential for maintenance of cooperation. In this paper, we investigate the effects of spatial structure and mobility on the evolution of cooperation. We consider a finite fixed size population of mobile individuals which are either cooperators or free-riders. Individuals never change their strategy throughout their lifetime. Individuals occupy

4 66 positions in a 1-dimensional lattice with periodic boundaries. In our model, any site can be occupied by multiple individuals, so it represents a fusion of lattice-structured populations, where any location can be occupied by at most one individual, and continuum-structured populations, where individuals may occupy any position in a continuum. The population is sparse in a sense that most locations remain vacant. Having empty sites may allow clusters of cooperators to isolate themselves from defectors and are known to help promote cooperation [2]. Individuals sample all possible locations within their migration range and are likely to move towards places with higher payoffs, i.e., towards cooperators and away from free-riders. In other words, we employ the success-driven migration model. We construct an exact stochastic simulation of this Markov process and run it over a wide range of parameters. This paper is an extension of preliminary work on this model reported in [28]. 2. Methods We consider a population of N individuals in a 1-dimensional lattice of length L with periodic boundaries. At the beginning of the simulation, each individual is assigned a random position in the lattice, and we allow multiple individuals to occupy the same position. Every individual is randomly assigned (with equal probability) the role of either cooperator or free-rider; individuals never change their strategy throughout their lifetime. An individual I m is in a neighborhood of an individual I n if the distance between them is at most D, which we call the neighborhood radius. So, a neighborhood of radius D of any individual consists of 2 D + 1 points in the lattice. All individuals in the same neighborhood interact with each other by competing for local resources, and every individual in the neighborhood gets an equal share of the resource. Let B be the benefit and C be the cost of cooperation. A cooperator provides the benefit B for each individual in its neighborhood (including itself) and pays a fixed cost C. The payoff of an individual I n is given by

5 Evolution of Cooperation in 1-dimensional Mobile Populations 67 pn 1 = B cn + Cn, (1) cn + fn where c n and f n are the numbers of cooperators and free-riders, respectively, in the neighborhood of the individual I n (including the individual itself), and C if In is a cooperator C n = (2) 0 if In is a free-rider is the cost of providing (cooperator) or not providing (free-rider) benefits to the neighbors. The term 1 ( c n + f n ) represents the competition for local resources among all individuals in the same neighborhood. For example, the payoff of an isolated free-rider is 1, while the payoff of an isolated cooperator is 1 + B C. In our model B < C, so that isolated cooperators have lower payoff than isolated free-riders and cooperators must form clusters in order to survive. Our Markov chain process consists of two types of events: reproduction and movement. We implement reproduction as a birth-death process (Moran process), see for example [16], in order to keep the population size constant. We apply a smoothing function to payoffs of the individuals and define the propensity of the individual I n to reproduce as tan 1 π r n = ( p n ) +. (3) 2 This is done to ensure that individuals with negative payoffs can reproduce and that individuals outside a cluster of potentially many cooperators can reproduce. In particular, this allows potential formation of several independent clusters of cooperators. If the reproduction event is going to occur, then one individual in the population is going to reproduce and the probability that an individual I n is chosen for reproduction is given by r n N r k =1 k. (4)

6 68 The offspring inherits the strategy (cooperator or free-rider) of its parent and is placed randomly in the neighborhood of the parent. (The size of the neighborhood is determined by the neighborhood radius parameter D.) Finally, a random individual of the original population (potentially including the parent) is removed in order to maintain the constant size of the population. The other event in our stochastic process is movement. One individual is going to move and the individual for the movement event is chosen randomly. Once an individual I n is chosen to move, it samples all possible locations it can move to from its current position based on the migration range R. We assume that the cost of such test interactions with potentially new neighbors is negligible and they do not affect an individual s payoff. An individual then picks its new location among 2 R + 1 possible ones with a probability positively correlated to the difference between the payoff at the potentially new location and its current payoff. More specifically, if the payoff at a potentially new location is p n, then the propensity of the individual I n to move from its current position with payoff location is given by exp( pn pn ). rule, which is often used in spatially structured models [25].) p n to this new (Note that this is similar to the Fermi The probabilistic nature of movement means that an individual may move to a position with lower payoff. However, such a move is less likely than the one that improves the individual s payoff, and the non-deterministic migration pattern gives individuals a chance to find global maxima by not getting trapped in the local ones. The mobility of the population is controlled by the mobility rate parameter M. It represents an average number of individual movement events for every reproduction event. The probability that the next event is reproduction is thus 1 ( M + 1) and the probability that the next event is movement is M ( M + 1). Table 1 summarizes all parameters of the simulation.

7 Evolution of Cooperation in 1-dimensional Mobile Populations 69 Table 1. Summary of the parameters of the model Parameter Meaning Range of values B Benefits of cooperation C C 1 C 1 C, +, +, C Cost of cooperation { 2, 3, 4} D Neighborhood radius { 1, 5, 10, 15, 20, 25, 30, 40} M Mobility rate { 0, 1, 10} N Size of the population { 10, 20, 30, 40} R Migration range { 1, 3, 5} We run each simulation until the Markov chain process reaches one of its two absorbing states: all cooperators or all free-riders. For each set of parameters, we run the simulation 10,000 times. The fraction of times the population ends up consisting of cooperators only is called the fixation probability of cooperators. The length L of the lattice is fixed at 100. The size of the population N ranges over { 10, 20, 30, 40}. In test simulations, we have found that increasing population size past 40 does not produce much difference in the results, so in actual full simulations, we capped the population size at 40. The neighborhood radius D ranges from 1 to 40; the actual values it assumes are { 1, 5, 10, 15, 20, 25, 30, 40}. The mobility rate M of the population ranges over { 0, 1, 10} with M = 0 corresponding to non-mobile population. We allow the possibility of zero mobility in order to isolate the effect of the spatial structure of the model on the fixation probability of cooperators. The migration range R ranges over { 1, 3, 5} and can be thought of as the speed of movement. The faster individuals can move, the farther they may migrate. We will now explain our choice of values for the benefit and cost parameters. First, B < C so that isolated cooperators have lower payoff than isolated free-riders. The difference between B and C determines the payoff of an isolated cooperator. Once an isolated cooperator is chosen for reproduction, a cluster of two cooperators is formed (provided that same cooperator is also not chosen to be removed from the population). Viability

8 70 of this cluster is in part determined by comparing payoffs of two cooperators with an isolated free-rider. If a cluster of as few as two cooperators provides higher reproduction propensity than that of isolated free-riders, then even a single reproduction event of an isolated cooperator may give rise to a thriving cooperating cluster. On the other hand, if more than two cooperators are needed to become favorites over free-riders, then fewer viable cooperating clusters will be formed. We have three possible values for the cost of cooperation, and for each value of the cost, we have four possible values of the benefits. The values of the benefit B are chosen in such a manner that the payoff of the cluster of two cooperators does not depend on the cost C. Indeed, if a neighborhood consists of k cooperators, then the payoff of each cooperator in this neighborhood is kb C + 1 k, and for k = 2, the C parameter cancels out since B is of the form C 2 + α, where α { 0, 1 4, 1 2, 3 4}. It follows that the B parameter controls viability of a cluster of two cooperators (and hence how likely reproduction of an isolated cooperator is to give rise to a competitive cluster of cooperators), and the C parameter controls payoffs of isolated cooperators (and hence how likely an isolated cooperator is to reproduce and to give rise to a cluster of two cooperators) and payoffs in clusters with three or more cooperators. Keep in mind that the effect of changing B or C parameters is not linear due to the smoothing function (3) used to compute reproduction propensities. 3. Results We ran the exact stochastic simulation of our Markov process for (almost) all possible combinations of parameters of the model. In this section, we illustrate the results of the simulation by choosing certain combinations of parameters only. In deciding which graphs are to be included in the paper, we simply tried to represent a wide variety of combinations of different parameters. The general observations we make and conclusions we draw remain valid for other combinations of parameters as well.

9 Evolution of Cooperation in 1-dimensional Mobile Populations Effect of spatial structure on the fixation probability of cooperators We begin by studying the effect of spatial structure and other parameters in our model on the fixation probability of cooperators. For this, we take the mobility out of the picture by letting M = 0. The only events in our stochastic process are now reproduction events Smaller neighborhoods promote cooperation A simple straightforward pattern of the effect of spatial structure emerges: the smaller the neighborhood size is, the higher the fixation probability of cooperators is. Also, once the neighborhood size becomes sufficiently large - about half the size of the entire lattice - cooperators become underdogs regardless of the other parameters. This is due to the fact that for such neighborhood size, there can be at most two clusters of individuals in the entire population and it essentially becomes a well-mixed population. Since free-riders pay no cost, they have slightly higher payoff than cooperators and this causes free-riders to dominate more often than cooperators. Cooperators cannot win more than 50% of the time in a wellmixed population case. This effect of the neighborhood size on the fixation probability of cooperators is consistent with observations in [14] Higher population density helps cooperators Next, we investigate the effect of population size on the fixation probability of cooperators. Since the lattice length in our simulations is fixed at 100, one can also think of the population size as population density. The general pattern is that higher density of the population helps cooperators; see Figure 1. Increasing the population size from 10 to 20 significantly improves cooperators chances, while increasing the population size past 30 results in marginal gains. As we already mentioned in Section 2, increasing the population size from 40 to 50 does not produce any meaningful difference in the fixation probability of cooperators. Also, we do not consider populations with more than 50 individuals since our model assumes sparse populations with the majority of lattice locations remaining vacant.

10 72 Figure 1. Higher population density increases the fixation probability of cooperators. The left diagram represents the best possible combination of benefit and cost parameters for cooperators: lowest cost with highest benefits. The right diagram shows the worst possible combination of benefit and cost parameters for cooperators: highest cost with lowest benefits. In a small population, cooperators often do not have sufficient time to aggregate in stable clusters before they become extinct. Figure 2 shows an average number of generations the simulation takes before the stochastic process reaches one of its two absorbing states. (We define a generation in population of size N as N consecutive reproduction events.) Even if a cluster of cooperators is formed, then it might be exploited by a defector who is more likely to reproduce and replace cooperators with its offspring. Cooperators often do not have either time or the numbers to form another cluster and are forced to extinction. For example, in the case of the worst possible combination of benefit and cost parameters for cooperators: highest cost ( C = 4) and lowest corresponding benefit ( B = 2), cooperators are never favorites over defectors in a population of size 10 (see the right diagram in Figure 1). If we increase the benefits to B = 2.25, then cooperators are slight favorites only when the neighborhood radius is minimal possible with D = 1.

11 Evolution of Cooperation in 1-dimensional Mobile Populations 73 Figure 2. The average number of generations the simulation takes for the stochastic process to reach one of its two absorbing states. A generation in a population of size N is defined as N consecutive reproduction events. The data is robust regardless of mobility rate. Increasing the population size to 20 significantly improves cooperators chances. First, cooperators have more time to regroup and produce clusters. Second, with higher population size, at least several clusters of cooperators are likely to form. As long as at least one of them is not exploited by defectors, it has a great chance to take over the entire population. Suppose at some point in the simulation, there are two clusters of cooperators, one of them contains only cooperators while another one also contains one or more defectors. With this arrangement, the defectors exploiting the second cluster will reproduce more often than cooperators in that same cluster. So, defectors are favored to drive cooperators in the second cluster to extinction. However, as soon as there are no more cooperators in the cluster, or simply the number of cooperators in the cluster is reduced significantly, the payoff of those defectors drops drastically. As a result, cooperators in the first unexploited cluster now enjoy the highest reproduction propensity and quickly take over the entire population. Increasing the population size to 30 results in slight improvement of the fixation probability of cooperators, while increasing the size further to 40 provides only marginal gains. With the most favorable combination of benefit and cost parameters for cooperators: lowest cost ( C = 2) and highest corresponding benefit ( B = 1.75), cooperators simply dominate defectors in

12 74 sufficiently dense populations for small neighborhood radius (see the left diagram in Figure 1). As explained in the previous paragraph, having several independent clusters of cooperators allows cooperators to better resist exploitation by defectors since there is a higher chance that at least one of the clusters will remain unexploited. Also, with higher population density, each cluster will have more individuals on average and due to the smoothing function (3), the difference in reproduction propensities of cooperators and exploiting defectors is very small. This makes it more difficult for defectors to exploit dense clusters of cooperators Effects of benefit and cost of cooperation Increasing benefits of cooperation while keeping the cost fixed naturally increases the fixation probability of cooperators. Figure 3 shows how the benefit parameter affects the reproduction propensity of cooperators in a cluster consisting of two individuals both of which are cooperators. The reproduction propensity of an isolated defector is the same as the reproduction propensity of a cluster of two cooperators for the second value of B, which in case C = 3 is equal to The effect of increasing benefits past this value is diminishing due to the smoothing function (3) used to transform an individual s payoff into its reproduction propensity. Figure 3. Increasing benefits of cooperation has diminishing effect on the reproduction propensity of a cluster of two cooperators. The graph shows benefit values corresponding to cost of cooperation C = 3, but the graph does not depend on the cost parameter.

13 Evolution of Cooperation in 1-dimensional Mobile Populations 75 The effect of the benefit parameter is higher for sparser population and smaller neighborhood radii; see Figure 4. In low density populations, most cooperators are isolated after the initial random set up and first clusters of cooperators that might arise will usually consist of two cooperators. Since the benefit parameter controls the vitality of a cluster of two cooperators, the effect is stronger if many cooperating clusters start with only two individuals. Also, with smaller neighborhood radius, the average size of a cluster is small, and hence clusters of only two cooperators are more likely to arise than in the case of larger value of neighborhood radius. Figure 4. Increasing benefits of cooperation while keeping the cost fixed helps promote cooperation. The effect is stronger for sparse populations and for small neighborhoods. The effect of increasing the benefits is diminishing. Having lower cost while maintaining the same relative level of benefits increases the fixation probability of cooperators; see Figure 5. Recall that

14 76 the cost parameter is designed to control the reproduction propensity of an isolated cooperator and a cluster of three or more cooperators. Lower cost helps isolated cooperators, but hurts large clusters of cooperators, while higher cost hurts isolated cooperators and helps large clusters of cooperators. Figure 5. Lowering the cost of cooperation while maintaining the same relative level of benefits helps cooperators. The effect of lower cost is stronger for sparse populations and small neighborhoods. Due to the smoothing function (3), which converts an individual s payoff to its reproduction propensity, increasing the payoff of an isolated cooperator has much stronger impact on promotion of cooperation than increasing payoff of a large cluster of cooperators. For example, lowering the cost from 3 to 2 while keeping the smallest benefit value for each cost increases an isolated cooperator s payoff from 0.5 to 0, which translates into an increase of its reproduction propensity from to , for a gain of almost

15 Evolution of Cooperation in 1-dimensional Mobile Populations 77 42%. On the other hand, it decreases the payoff of a cluster of three cooperators from 11 6 to 4 3, which translates into a decrease in reproduction propensity from to , for a loss of only 5.5%. Since adjusting cost has significant effect on reproduction propensity of isolated cooperators and only marginal effect on the reproduction propensity of large clusters of cooperators, it is only natural that the effect of cost parameter is higher for sparse populations and small neighborhood radii. For dense populations and large neighborhoods, lowering cost of cooperation has marginal impact since there are fewer isolated cooperators and more large clusters of individuals Effect of mobility on the fixation probability of cooperators We discovered how neighborhood size, population density, benefit and cost parameters affect the fixation probability of cooperators. Now we bring mobility into the model and investigate how different mobility rates and migration range affect cooperators. The general pattern turns out to be that mobility does not help cooperators and may, in fact, lead to an almost complete breakdown of cooperation Increasing mobility rate decreases the fixation probability of cooperators If cooperators dominate free-riders, which is the case for small neighborhoods and dense populations, then increasing mobility rate decreases the fixation probability of cooperators. This is consistent with our expectation that if the spatial structure alone is sufficient to promote cooperation, then introducing additional factors, such as mobility, into the model would only hurt cooperators. On the other hand, for sparse populations and large neighborhoods, when cooperators do not rate so well, mobility has no visible effect on the outcome of the simulation. When free-riders are favorites over cooperators, then even allowing individuals to migrate in efforts to improve their payoff does not increase the fixation probability of cooperators.

16 78 Figure 6. Increasing mobility rate does not help cooperators. In cases when cooperators dominate free-riders - small neighborhoods and dense populations - higher mobility rates decrease the fixation probability of cooperators. If free-riders are favorites over cooperators, then allowing individuals to migrate trying to improve their payoff still does not help cooperators to do better. Figure 6 shows the effect of different mobility rates on the evolution of cooperation in case the migration range is minimal possible at 1. Notice that the negative effect of mobility is stronger in cases when cooperators do best: small neighborhoods and dense populations. Once the neighborhoods become sufficiently large and our model essentially becomes identical to a well-mixed population case, then mobility naturally has no effect on cooperation.

17 Evolution of Cooperation in 1-dimensional Mobile Populations 79 Notice how in Figure 6 in the diagram for population size 40, cooperators do slightly better with increased mobility rate when the neighborhood radius is equal to 20. We have observed similar, though less pronounced, patterns for certain other combinations of parameters for D = 20. However, for many other combinations of parameters with D = 20, this does not happen, so we refrain from drawing any conclusions. This can be the effect of stochastic noise. But there is a strong pattern that regardless of other parameters of the model, increasing mobility rate does not hurt cooperators if the neighborhood radius is at least Increasing migration range may result in a breakdown of cooperation Since increasing mobility rate often allows free-riders to exploit cooperators, it is only natural to expect that increasing migration range would only make this exploitation mechanism more effective for free-riders. While Figure 6 shows that increasing mobility rate has little negative effect on the fixation probability of cooperators when the migration range is minimal possible at R = 1, Figure 7 demonstrates that with longer migration range, the situation is notably worse for cooperators. Increasing the migration range from R = 1 to R = 5 while keeping the mobility rate fixed at M = 1 is almost equivalent to increasing the mobility rate from M = 1 to M = 10 while keeping the migration range fixed at R = 1. Also, notice that in the top left diagram in Figure 7, corresponding to the case of population size 10, the graph dips when the neighborhood radius is at D = 1. This is the only combination of parameters (lowest benefit to cost ratio and smallest population) where this phenomenon occurs if the mobility rate is fixed at 1. We discuss it further in the case of mobility rate 10 where it is even more pronounced causing a breakdown of cooperation for some combinations of parameters.

18 80 Figure 7. Increasing migration range has visible negative impact on the fixation probability of cooperators even when the mobility rate is equal to 1. The situation is much worse for cooperators if the migration range is increased when the mobility rate is higher with M = 10; see Figure 8. Notice how increasing migration range flattens the fixation probability curves. If individuals are allowed to migrate further, then even small neighborhoods - cooperator s paradise - are no longer sufficient for domination of cooperation. This is an expected result since increasing migration range gives free-riders ample opportunities to locate and exploit clusters of cooperators with small footprint. So it effectively negates the advantage of isolation of small neighborhood clusters.

19 Evolution of Cooperation in 1-dimensional Mobile Populations 81 Figure 8. Increasing migration range has significant negative impact on the fixation probability of cooperators when the mobility rate is equal to 10. Longer migration range has flattening effect on the fixation probability curves with higher mobility rate. The negative impact of longer migration range coupled with high mobility rate on evolution of cooperation is extremely strong for small neighborhoods and dense populations. Also, the negative impact of longer migration range on the fixation probability of cooperators is extremely strong for dense populations, where cooperators dominate defectors if mobility rate and migration range are limited. The effect of flattening the fixation probability curves is most dramatic in the situations where they used to be fairly steep. Of course, when neighborhoods are sufficiently large (at least half the size of the lattice), then increasing migration range has no impact on the evolution of cooperation. In this case, the model is essentially equivalent to the well-mixed population case where mobility factors play no role.

20 82 A truly unexpected result of our simulations is that a combination of sparse population, small neighborhoods, low benefit to cost ratio, high mobility, and long migration range causes an almost complete breakdown of cooperation; see Figure 9. Figure 9. A combination of sparse population and small neighborhood radius causes breakdown of cooperation for small benefit to cost ratios if both mobility rate and migration range are large. There is no such effect on denser populations or if the benefit to cost ratio is sufficiently high. While we do not have an exhaustive explanation of this phenomenon, we will try to provide some insight. First of all, under the best of circumstances, sparse populations have lower fixation probabilities of cooperators than dense populations; this has been discussed earlier. Combining sparse population with small neighborhood radius results in clusters with relatively few individuals. With high mobility rate and long migration radius, free-

21 Evolution of Cooperation in 1-dimensional Mobile Populations 83 riders can easily locate and exploit such clusters. The fewer cooperators there are in a cluster the easier they are to exploit. This is because due to the smoothing function (3), free-riders have only marginally better payoffs than cooperators in a cluster with sufficiently many cooperators. Dense populations usually have larger clusters and these are more difficult to exploit even if free-riders can locate them. If the neighborhood size is increased, then the average size of a cluster becomes larger even for sparse populations. Large clusters are harder to exploit, so certain stable levels of cooperation can be maintained. The impact of low benefit to cost ratio on breakdown of cooperation is more difficult to explain. Recall that varying the benefit parameter affects viability of a cluster of two cooperators. In sparse populations, most cooperating clusters start off as clusters of two cooperators only. Therefore, it is extremely important for such clusters to have sufficiently high payoff compared to free-riders. Recall from Figure 3 that the effect of increasing benefits is stronger for sparse populations. Free-riders can easily locate and breakdown small cooperating clusters when mobility rate and migration range are sufficiently high. Cooperators need to be able to create and develop new clusters once old ones had been exploited by free-riders. Such newly formed clusters have a better chance of developing if the benefit parameter is as high as possible. By the time remaining, free-riders are able to locate them, they may grow in size and hence be able to resist invasion. 4. Discussion We have created an exact stochastic simulation to investigate how spatial structure and mobility affect evolution of cooperation. In our model, individuals never change their strategy throughout their lifetime: individuals that are born as cooperators remain cooperators and individuals that are born as free-riders remain free-riders. Individuals reside on a 1-dimensional lattice with periodic boundaries and are allowed to migrate at a certain rate. Our model differs from standard lattice-structures models in that multiple

22 84 individuals may occupy the same location. This affects the outcome of the simulation, as we will explain below. We have found that cooperators dominate free-riders when the population is sufficiently dense, neighborhoods are small, and mobility rate is set to zero. The effect of small neighborhoods is well understood and the outcome of the simulation illustrates that having small neighborhoods allows cooperative clusters to isolate themselves from free-riders; this is crucial for the maintenance of cooperation. On the other hand, it might not be intuitionally clear why increasing the density of the population helps cooperators. It seems that with higher population, density cooperative clusters will find it difficult to isolate themselves from free-riders. However, in our model, lattice points can be occupied by more than one individual. This allows formation of dense compact cooperative clusters which are hard to exploit. The effect of the density of the population on the evolution of cooperation in our model contrasts with previous standard lattice-structured models where lower density of the population was usually found to be beneficial for cooperators. However, even for standard lattice-structured models, higher density of the population may be beneficial for the evolution of cooperation under certain circumstances [30]. Cooperators thrive if they aggregate in clusters and resist exploitation by free-riders. In order to resist exploitation, the cooperative clusters should be (a) numerous, and (b) hard to breakdown if located by free-riders. Combination of small neighborhoods and dense population assures that both (a) and (b) hold. With small neighborhood size, the entire population gets split into many independent clusters; the larger the population, the more clusters there are. The more cooperative clusters there are the higher the chance that some of them will not be exploited and continue to thrive. Higher density of the population also results in larger average size of clusters, and due to the smoothing function (3), the difference in reproduction propensity between cooperators and free-riders in such clusters is negligible. Hence, dense cooperating clusters can resist invasion by free-riders.

23 Evolution of Cooperation in 1-dimensional Mobile Populations 85 Increasing mobility rate of the population in general decreases the fixation probability of cooperators. Mobility has no effect on the evolution of cooperation for large neighborhoods since in this case, we are essentially dealing with a well-mixed population case. However, high mobility rate visibly decreases cooperators chances for small neighborhoods. This is because allowing individuals to migrate somewhat negates the advantage of isolation of compact cooperative clusters. Cooperators are still big favorites over free-riders in dense populations when neighborhoods are small, but the fixation probability of cooperators is decreasing as the mobility rate is increasing. The surprising result of our simulation is that increasing the migration range may result in breakdown of cooperation. Long migration range coupled with high mobility rate allows free-riders to dominate cooperators if the population is sparse, neighborhoods are minimal in size, and benefits of cooperation are low. This does not occur if the population is relatively dense (30 or 40 individuals), if the neighborhood radius is 5 or more, or if the benefits of cooperation are high. In cases when cooperation does not breakdown, longer migration range flattens the fixation probability curves since it negates the advantage of possible isolation of cooperative clusters when neighborhoods are small. We believe that one of the main reasons that high mobility rate has such a negative effect on the fixation probability of cooperators is the probabilistic nature of movement in our model. An individual may improve its payoff drastically by joining a cluster of cooperators. So, if there is a chance that a given move results in joining a cooperating cluster, then such a move is very likely to occur since the difference in payoff is going to be fairly large. This makes it relatively easy for free-riders to locate and try to exploit cooperators. On the other hand, an individual improves its payoff only marginally by moving away from free-riders. So, if such a move is possible, then it has only slightly higher likelihood of being chosen than less optimal moves. This makes running away from free-riders much more difficult.

24 86 The success-driven migration mechanism, we employ in this paper somewhat differs from the model in [28]. In [28], individuals who can improve their payoff the most were more likely to move, while in our current model, a random individual is chosen to move. Our motivation for this adjustment is two-fold. First, joining a cluster of cooperators improves individual s payoff drastically, while running away from a free-rider improves individual s payoff only marginally. So, the model in [28] made it much easier for free-riders to exploit cooperators than for cooperators to resist such exploitation. As a result, introducing even the minimal amount of mobility into the model significantly reduced fixation probability of cooperators. Our current model represents a uniformly mobile population, where every individual is given equal opportunity to migrate. Second, this model significantly reduces computational time. There are several directions in which we plan to extend this work. First, we would like to investigate the effect of other migration models on the fixation probability of cooperators. For example, we may employ a deterministic movement model where every individual moves deterministically to a location with maximum possible payoff. This makes both chasing cooperators and running away from free-riders equally likely to occur in the migration patterns. We hope that this would reduce the negative effect of high mobility rates, and, perhaps, even help cooperators in certain circumstances. Second, we would like to create a similar simulation for 2-dimensional lattices. It would be interesting to see if there are any significant quantitative and qualitative differences between 1-dimensional and 2-dimensional models. References [1] C. Athena Aktipis, Know when to walk away: contingent movement and the evolution of cooperation, J. Theoret. Biol. 231 (2004), [2] Samuel Alizon and Peter Taylor, Empty sites can promote altruistic behavior, Evolution 62(6) (2008), [3] Alberto Antonioni and Marco Tomassini, Network fluctuations hinder cooperation in evolutionary games, PloS One 6(10) (2011), e25555.

25 Evolution of Cooperation in 1-dimensional Mobile Populations 87 [4] Alberto Antonioni, Marco Tomassini and Pierre Buesser, Random diffusion and cooperation in continuous two-dimensional space, J. Theoret. Biol. 344 (2014), [5] Robert M. Axelrod, The Evolution of Cooperation, Basic Books, [6] Kurt Brauchli, Timothy Killingback and Michael Doebeli, Evolution of cooperation in spatially structured populations, J. Theoret. Biol. 200 (1999), [7] Pierre Buesser, Marco Tomassini and Alberto Antonioni, Opportunistic migration in spatial evolutionary games, Physical Review E 88 (2013), [8] Rui Cong, Bin Wu, Yuanying Qiu and Long Wang, Evolution of cooperation driven by reputation-based migration, PloS One 7(5) (2012), e [9] Magnus Enquist and Olof Leimar, The evolution of cooperation in mobile organisms, Anim. Behav. 45 (1993), [10] Anatolij Gelimson, Jonas Cremer and Erwin Frey, Mobility, fitness collection, and the breakdown of cooperation, Physical Review E 87(4) (2013), [11] Christoph Hauert and Michael Doebeli, Spatial structure often inhibits the evolution of cooperation in the snowdrift game, Nature 428 (2004), [12] Dirk Helbing and Wenjian Yu, The outbreak of cooperation among success-driven individuals under noisy conditions, PNAS 106(10) (2009), [13] Josef Hofbauer and Karl Sigmund, Evolutionary Games and Population Dynamics, Cambridge University Press, [14] Margarita Ifti, Timothy Killingback and Michael Doebeli, Effects of neighbourhood size and connectivity on the spatial continuous prisoner s dilemma, J. Theoret. Biol. 231 (2004), [15] Ning Jia and Shoufeng Ma, Evolution of cooperation in the snowdrift game among mobile players with random-pairing and reinforcement learning, Phys. A 392 (2013), [16] Erez Lieberman, Christoph Hauert and Martin A. Nowak, Evolutionary dynamics on graphs, Nature 433 (2005), [17] Hai Lin, Dong-Ping Yang and J. W. Shuai, Cooperation among mobile individuals with payoff expectations in the spatial prisoner s dilemma game, Chaos Solitons Fractals 44 (2011), [18] M. Nakamaru, H. Matsuda and Y. Iwasa, The evolution of cooperation in a latticestructured population, J. Theoret. Biol. 184 (1997),

26 88 [19] Martin A. Nowak, Evolutionary Dynamics: Exploring the Equations of Life, Harvard University Press, [20] Martin A. Nowak, Five rules for the evolution of cooperation, Science 314 (2006), [21] Martin A. Nowak, Sebastian Bonhoeffer and Robert M. May, Spatial games and the maintenance of cooperation, Proc. Natl. Acad. Sci. USA 91 (1994), [22] Martin A. Nowak and Robert M. May, Evolutionary games and spatial chaos, Nature 359 (1992), [23] Hisashi Ohtsuki, Christoph Hauert, Erez Lieberman and Martin A. Nowak, A simple rule for the evolution of cooperation on graphs and social networks, Nature 441 (2006), [24] Carlos P. Roca, José A. Cuesta and Angel Sánchez, Effect of spatial structure on the evolution of cooperation, Physical Review E 80(4) (2009), [25] Carlos P. Roca, José A. Cuesta and Angel Sánchez, Evolutionary game theory: temporal and spatial effects beyond replicator dynamics, Physics of Life Reviews 6 (2009), [26] Estrella A. Sicardi, Hugo Fort, Mendeli H. Vainstein and Jeferson J. Arenzon, Random mobility and spatial structure often enhance cooperation, J. Theoret. Biol. 256 (2009), [27] John Maynard Smith, Evolution and the Theory of Games, Cambridge University Press, [28] David Suarez, Praveen Suthaharan, Jonathan Rowell and Jan Rychtář, Evolution of cooperation in mobile populations, Spora 1(1) (2015), 2-7. [29] György Szabó and Gábor Fáth, Evolutionary games on graphs, Phys. Rep. 446 (2007), [30] Marco Tomassini and Alberto Antonioni, Lévy flights and cooperation among mobile individuals, J. Theoret. Biol. 364 (2015), [31] Mendeli H. Vainstein, Ana T. C. Silva and Jeferson J. Arenzon, Does mobility decrease cooperation? J. Theoret. Biol. 244 (2007), [32] Te Wu, Feng Fu and Long Wang, Moving away from nasty encounters enhances cooperation in ecological prisoner s dilemma game, PloS One 6(11) (2011), e [33] Chunyan Zhang, Jianlei Zhang, Guangming Xie, Long Wang and Matjaž Perc, Evolution of interactions and cooperation in the spatial prisoner s dilemma game, PloS One 6(10) (2011), e26724.

Evolutionary prisoner s dilemma game on hierarchical lattices

Evolutionary prisoner s dilemma game on hierarchical lattices PHYSICAL REVIEW E 71, 036133 2005 Evolutionary prisoner s dilemma game on hierarchical lattices Jeromos Vukov Department of Biological Physics, Eötvös University, H-1117 Budapest, Pázmány Péter sétány

More information

Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions

Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions Commun. Theor. Phys. 57 (2012) 547 552 Vol. 57, No. 4, April 15, 2012 Evolution of Cooperation in Evolutionary Games for Heterogeneous Interactions QIAN Xiao-Lan ( ) 1, and YANG Jun-Zhong ( ) 2 1 School

More information

Does migration cost influence cooperation among success-driven individuals?

Does migration cost influence cooperation among success-driven individuals? International Institute for Applied Systems Analysis Schlossplatz 1 A-2361 Laxenburg, Austria Tel: +43 2236 807 342 Fax: +43 2236 71313 E-mail: publications@iiasa.ac.at Web: www.iiasa.ac.at Interim Report

More information

The evolution of cooperation is affected by the persistence of fitness effects, the neighborhood size and their interaction

The evolution of cooperation is affected by the persistence of fitness effects, the neighborhood size and their interaction Letters in Biomathematics, 2015 Vol. 2, No. 1, 67 78, http://dx.doi.org/10.1080/23737867.2015.1090890 OPEN ACCESS The evolution of cooperation is affected by the persistence of fitness effects, the neighborhood

More information

arxiv: v2 [q-bio.pe] 18 Dec 2007

arxiv: v2 [q-bio.pe] 18 Dec 2007 The Effect of a Random Drift on Mixed and Pure Strategies in the Snowdrift Game arxiv:0711.3249v2 [q-bio.pe] 18 Dec 2007 André C. R. Martins and Renato Vicente GRIFE, Escola de Artes, Ciências e Humanidades,

More information

Behavior of Collective Cooperation Yielded by Two Update Rules in Social Dilemmas: Combining Fermi and Moran Rules

Behavior of Collective Cooperation Yielded by Two Update Rules in Social Dilemmas: Combining Fermi and Moran Rules Commun. Theor. Phys. 58 (2012) 343 348 Vol. 58, No. 3, September 15, 2012 Behavior of Collective Cooperation Yielded by Two Update Rules in Social Dilemmas: Combining Fermi and Moran Rules XIA Cheng-Yi

More information

arxiv: v1 [physics.soc-ph] 27 May 2016

arxiv: v1 [physics.soc-ph] 27 May 2016 The Role of Noise in the Spatial Public Goods Game Marco Alberto Javarone 1, and Federico Battiston 2 1 Department of Mathematics and Computer Science, arxiv:1605.08690v1 [physics.soc-ph] 27 May 2016 University

More information

Darwinian Evolution of Cooperation via Punishment in the Public Goods Game

Darwinian Evolution of Cooperation via Punishment in the Public Goods Game Darwinian Evolution of Cooperation via Punishment in the Public Goods Game Arend Hintze, Christoph Adami Keck Graduate Institute, 535 Watson Dr., Claremont CA 97 adami@kgi.edu Abstract The evolution of

More information

Evolution of Cooperation in Continuous Prisoner s Dilemma Games on Barabasi Albert Networks with Degree-Dependent Guilt Mechanism

Evolution of Cooperation in Continuous Prisoner s Dilemma Games on Barabasi Albert Networks with Degree-Dependent Guilt Mechanism Commun. Theor. Phys. 57 (2012) 897 903 Vol. 57, No. 5, May 15, 2012 Evolution of Cooperation in Continuous Prisoner s Dilemma Games on Barabasi Albert Networks with Degree-Dependent Guilt Mechanism WANG

More information

Physica A. Promoting cooperation by local contribution under stochastic win-stay-lose-shift mechanism

Physica A. Promoting cooperation by local contribution under stochastic win-stay-lose-shift mechanism Physica A 387 (2008) 5609 5615 Contents lists available at ScienceDirect Physica A journal homepage: www.elsevier.com/locate/physa Promoting cooperation by local contribution under stochastic win-stay-lose-shift

More information

Instability in Spatial Evolutionary Games

Instability in Spatial Evolutionary Games Instability in Spatial Evolutionary Games Carlos Grilo 1,2 and Luís Correia 2 1 Dep. Eng. Informática, Escola Superior de Tecnologia e Gestão, Instituto Politécnico de Leiria Portugal 2 LabMag, Dep. Informática,

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

arxiv: v2 [physics.soc-ph] 29 Aug 2017

arxiv: v2 [physics.soc-ph] 29 Aug 2017 Conformity-Driven Agents Support Ordered Phases in the Spatial Public Goods Game Marco Alberto Javarone, 1, Alberto Antonioni, 2, 3, 4 and Francesco Caravelli 5, 6 1 Department of Mathematics and Computer

More information

Complex networks and evolutionary games

Complex networks and evolutionary games Volume 2 Complex networks and evolutionary games Michael Kirley Department of Computer Science and Software Engineering The University of Melbourne, Victoria, Australia Email: mkirley@cs.mu.oz.au Abstract

More information

Evolutionary Games and Computer Simulations

Evolutionary Games and Computer Simulations Evolutionary Games and Computer Simulations Bernardo A. Huberman and Natalie S. Glance Dynamics of Computation Group Xerox Palo Alto Research Center Palo Alto, CA 94304 Abstract The prisoner s dilemma

More information

arxiv: v1 [q-bio.pe] 20 Feb 2008

arxiv: v1 [q-bio.pe] 20 Feb 2008 EPJ manuscript No. (will be inserted by the editor) Diversity of reproduction rate supports cooperation in the arxiv:0802.2807v1 [q-bio.pe] 20 Feb 2008 prisoner s dilemma game on complex networks Attila

More information

Spatial three-player prisoners dilemma

Spatial three-player prisoners dilemma Spatial three-player prisoners dilemma Rui Jiang, 1 Hui Deng, 1 Mao-Bin Hu, 1,2 Yong-Hong Wu, 2 and Qing-Song Wu 1 1 School of Engineering Science, University of Science and Technology of China, Hefei

More information

Evolution of cooperation. Martin Nowak, Harvard University

Evolution of cooperation. Martin Nowak, Harvard University Evolution of cooperation Martin Nowak, Harvard University As the Fukushima power plant was melting down, a worker in his 20s was among those who volunteered to reenter. In an interview he said: There are

More information

Coevolutionary success-driven multigames

Coevolutionary success-driven multigames October 2014 EPL, 108 (2014) 28004 doi: 10.1209/0295-5075/108/28004 www.epljournal.org Coevolutionary success-driven multigames Attila Szolnoki 1 and Matjaž Perc 2,3,4 1 Institute of Technical Physics

More information

S ince the seminal paper on games and spatial chaos1, spatial reciprocity has been built upon as a powerful

S ince the seminal paper on games and spatial chaos1, spatial reciprocity has been built upon as a powerful SUBJECT AREAS: STATISTICAL PHYSICS, THERMODYNAMICS AND NONLINEAR DYNAMICS COMPUTATIONAL BIOLOGY BIOPHYSICS SUSTAINABILITY Received 5 March 2012 Accepted 29 March 2012 Published 17 April 2012 Correspondence

More information

Topology-independent impact of noise on cooperation in spatial public goods games

Topology-independent impact of noise on cooperation in spatial public goods games PHYSIAL REVIEW E 80, 056109 2009 Topology-independent impact of noise on cooperation in spatial public goods games Attila Szolnoki, 1 Matjaž Perc, 2 and György Szabó 1 1 Research Institute for Technical

More information

Emergence of Cooperation and Evolutionary Stability in Finite Populations

Emergence of Cooperation and Evolutionary Stability in Finite Populations Emergence of Cooperation and Evolutionary Stability in Finite Populations The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation

More information

Genetic stability and territorial structure facilitate the evolution of. tag-mediated altruism. Lee Spector a and Jon Klein a,b

Genetic stability and territorial structure facilitate the evolution of. tag-mediated altruism. Lee Spector a and Jon Klein a,b 1 To appear as: Spector, L., and J. Klein. 2006. Genetic Stability and Territorial Structure Facilitate the Evolution of Tag-mediated Altruism. In Artificial Life, Vol. 12, No. 4. Published by MIT Press

More information

stochastic, evolutionary game dynamics in finite populations

stochastic, evolutionary game dynamics in finite populations PHYSICAL REVIEW E 80, 011909 2009 Deterministic evolutionary game dynamics in finite populations Philipp M. Altrock* and Arne Traulsen Emmy-Noether Group of Evolutionary Dynamics, Department of Evolutionary

More information

Complexity in social dynamics : from the. micro to the macro. Lecture 4. Franco Bagnoli. Lecture 4. Namur 7-18/4/2008

Complexity in social dynamics : from the. micro to the macro. Lecture 4. Franco Bagnoli. Lecture 4. Namur 7-18/4/2008 Complexity in Namur 7-18/4/2008 Outline 1 Evolutionary models. 2 Fitness landscapes. 3 Game theory. 4 Iterated games. Prisoner dilemma. 5 Finite populations. Evolutionary dynamics The word evolution is

More information

Dynamics and Chaos. Melanie Mitchell. Santa Fe Institute and Portland State University

Dynamics and Chaos. Melanie Mitchell. Santa Fe Institute and Portland State University Dynamics and Chaos Melanie Mitchell Santa Fe Institute and Portland State University Dynamical Systems Theory: The general study of how systems change over time Calculus Differential equations Discrete

More information

Kalle Parvinen. Department of Mathematics FIN University of Turku, Finland

Kalle Parvinen. Department of Mathematics FIN University of Turku, Finland Adaptive dynamics: on the origin of species by sympatric speciation, and species extinction by evolutionary suicide. With an application to the evolution of public goods cooperation. Department of Mathematics

More information

Alana Schick , ISCI 330 Apr. 12, The Evolution of Cooperation: Putting gtheory to the Test

Alana Schick , ISCI 330 Apr. 12, The Evolution of Cooperation: Putting gtheory to the Test Alana Schick 43320027, ISCI 330 Apr. 12, 2007 The Evolution of Cooperation: Putting gtheory to the Test Evolution by natural selection implies that individuals with a better chance of surviving and reproducing

More information

Game interactions and dynamics on networked populations

Game interactions and dynamics on networked populations Game interactions and dynamics on networked populations Chiara Mocenni & Dario Madeo Department of Information Engineering and Mathematics University of Siena (Italy) ({mocenni, madeo}@dii.unisi.it) Siena,

More information

arxiv: v1 [physics.soc-ph] 13 Feb 2017

arxiv: v1 [physics.soc-ph] 13 Feb 2017 Evolutionary dynamics of N-person Hawk-Dove games Wei Chen 1, Carlos Gracia-Lázaro 2, Zhiwu Li 3,1, Long Wang 4, and Yamir Moreno 2,5,6 arxiv:1702.03969v1 [physics.soc-ph] 13 Feb 2017 1 School of Electro-Mechanical

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION Social diversity promotes the emergence of cooperation in public goods games Francisco C. Santos 1, Marta D. Santos & Jorge M. Pacheco 1 IRIDIA, Computer and Decision Engineering Department, Université

More information

New Journal of Physics

New Journal of Physics New Journal of Physics The open access journal for physics Double resonance in cooperation induced by noise and network variation for an evolutionary prisoner s dilemma Matjaž Perc Department of Physics,

More information

arxiv: v1 [cs.gt] 7 Aug 2012

arxiv: v1 [cs.gt] 7 Aug 2012 Building Cooperative Networks Ignacio Gomez Portillo Grup de Física Estadística, Departament de Física, Universitat Autónoma de Barcelona, 08193 Barcelona, Spain. Abstract We study the cooperation problem

More information

arxiv:q-bio/ v1 [q-bio.pe] 24 May 2004

arxiv:q-bio/ v1 [q-bio.pe] 24 May 2004 Effects of neighbourhood size and connectivity on the spatial Continuous Prisoner s Dilemma arxiv:q-bio/0405018v1 [q-bio.pe] 24 May 2004 Margarita Ifti a,d Timothy Killingback b Michael Doebeli c a Department

More information

Chapter 7. Evolutionary Game Theory

Chapter 7. Evolutionary Game Theory From the book Networks, Crowds, and Markets: Reasoning about a Highly Connected World. By David Easley and Jon Kleinberg. Cambridge University Press, 2010. Complete preprint on-line at http://www.cs.cornell.edu/home/kleinber/networks-book/

More information

The Replicator Equation on Graphs

The Replicator Equation on Graphs The Replicator Equation on Graphs The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published Version Accessed Citable

More information

MATCHING STRUCTURE AND THE EVOLUTION OF COOPERATION IN THE PRISONER S DILEMMA

MATCHING STRUCTURE AND THE EVOLUTION OF COOPERATION IN THE PRISONER S DILEMMA MATCHING STRUCTURE AN THE EVOLUTION OF COOPERATION IN THE PRISONER S ILEMMA Noureddine Bouhmala 1 and Jon Reiersen 2 1 epartment of Technology, Vestfold University College, Norway noureddine.bouhmala@hive.no

More information

Effect of Growing Size of Interaction Neighbors on the Evolution of Cooperation in Spatial Snowdrift Game

Effect of Growing Size of Interaction Neighbors on the Evolution of Cooperation in Spatial Snowdrift Game Commun. Theor. Phys. 57 (2012) 541 546 Vol. 57, No. 4, April 15, 2012 Effect of Growing Size of Interaction Neighbors on the Evolution of Cooperation in Spatial Snowdrift Game ZHANG Juan-Juan ( ), 1 WANG

More information

Game Theory, Population Dynamics, Social Aggregation. Daniele Vilone (CSDC - Firenze) Namur

Game Theory, Population Dynamics, Social Aggregation. Daniele Vilone (CSDC - Firenze) Namur Game Theory, Population Dynamics, Social Aggregation Daniele Vilone (CSDC - Firenze) Namur - 18.12.2008 Summary Introduction ( GT ) General concepts of Game Theory Game Theory and Social Dynamics Application:

More information

Understanding and Solving Societal Problems with Modeling and Simulation

Understanding and Solving Societal Problems with Modeling and Simulation Understanding and Solving Societal Problems with Modeling and Simulation Lecture 8: The Breakdown of Cooperation ETH Zurich April 15, 2013 Dr. Thomas Chadefaux Why Cooperation is Hard The Tragedy of the

More information

Evolutionary Games on Networks. Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks

Evolutionary Games on Networks. Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks Evolutionary Games on Networks Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks Email: wenxuw@gmail.com; wxwang@cityu.edu.hk Cooperative behavior among selfish individuals Evolutionary

More information

An Introduction to Evolutionary Game Theory: Lecture 2

An Introduction to Evolutionary Game Theory: Lecture 2 An Introduction to Evolutionary Game Theory: Lecture 2 Mauro Mobilia Lectures delivered at the Graduate School on Nonlinear and Stochastic Systems in Biology held in the Department of Applied Mathematics,

More information

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples February 24, 2011 Summary: We introduce the Nash Equilibrium: an outcome (action profile) which is stable in the sense that no player

More information

ARTICLE IN PRESS. Journal of Theoretical Biology

ARTICLE IN PRESS. Journal of Theoretical Biology ARTICLE IN PRE Journal of Theoretical Biology 256 (29) 24 246 Contents lists available at ciencedirect Journal of Theoretical Biology journal homepage: www.elsevier.com/locate/yjtbi Random mobility and

More information

Reputation-based mutual selection rule promotes cooperation in spatial threshold public goods games

Reputation-based mutual selection rule promotes cooperation in spatial threshold public goods games International Institute for Applied Systems Analysis Schlossplatz 1 A-2361 Laxenburg, Austria Tel: +43 2236 807 342 Fax: +43 2236 71313 E-mail: publications@iiasa.ac.at Web: www.iiasa.ac.at Interim Report

More information

Evolution of Diversity and Cooperation 2 / 3. Jorge M. Pacheco. Departamento de Matemática & Aplicações Universidade do Minho Portugal

Evolution of Diversity and Cooperation 2 / 3. Jorge M. Pacheco. Departamento de Matemática & Aplicações Universidade do Minho Portugal Evolution of Diversity and Cooperation 2 / 3 Jorge M. Pacheco Departamento de Matemática & Aplicações Universidade do Minho Portugal Luis Santaló School, 18 th of July, 2013 prisoner s dilemma C D C (

More information

Application of Evolutionary Game theory to Social Networks: A Survey

Application of Evolutionary Game theory to Social Networks: A Survey Application of Evolutionary Game theory to Social Networks: A Survey Pooya Esfandiar April 22, 2009 Abstract Evolutionary game theory has been expanded to many other areas than mere biological concept

More information

Human society is organized into sets. We participate in

Human society is organized into sets. We participate in Evolutionary dynamics in set structured populations Corina E. Tarnita a, Tibor Antal a, Hisashi Ohtsuki b, and Martin A. Nowak a,1 a Program for Evolutionary Dynamics, Department of Mathematics, Department

More information

Phase transitions in social networks

Phase transitions in social networks Phase transitions in social networks Jahan Claes Abstract In both evolution and economics, populations sometimes cooperate in ways that do not benefit the individual, and sometimes fail to cooperate in

More information

arxiv: v1 [cs.gt] 17 Aug 2016

arxiv: v1 [cs.gt] 17 Aug 2016 Simulation of an Optional Strategy in the Prisoner s Dilemma in Spatial and Non-spatial Environments Marcos Cardinot, Maud Gibbons, Colm O Riordan, and Josephine Griffith arxiv:1608.05044v1 [cs.gt] 17

More information

Some Analytical Properties of the Model for Stochastic Evolutionary Games in Finite Populations with Non-uniform Interaction Rate

Some Analytical Properties of the Model for Stochastic Evolutionary Games in Finite Populations with Non-uniform Interaction Rate Commun Theor Phys 60 (03) 37 47 Vol 60 No July 5 03 Some Analytical Properties of the Model for Stochastic Evolutionary Games in Finite Populations Non-uniform Interaction Rate QUAN Ji ( ) 3 and WANG Xian-Jia

More information

ALTRUISM OR JUST SHOWING OFF?

ALTRUISM OR JUST SHOWING OFF? ALTRUISM OR JUST SHOWING OFF? Soha Sabeti ISCI 330 April 12/07 Altruism or Just Showing Off? Among the many debates regarding the evolution of altruism are suggested theories such as group selection, kin

More information

Evolutionary dynamics on graphs: Efficient method for weak selection

Evolutionary dynamics on graphs: Efficient method for weak selection Evolutionary dynamics on graphs: Efficient method for weak selection Feng Fu, 1,2 Long Wang, 2 Martin A. owak, 1,3 and Christoph Hauert 1,4, * 1 Program for Evolutionary Dynamics, Harvard University, Cambridge,

More information

Computation of Efficient Nash Equilibria for experimental economic games

Computation of Efficient Nash Equilibria for experimental economic games International Journal of Mathematics and Soft Computing Vol.5, No.2 (2015), 197-212. ISSN Print : 2249-3328 ISSN Online: 2319-5215 Computation of Efficient Nash Equilibria for experimental economic games

More information

N-Player Prisoner s Dilemma

N-Player Prisoner s Dilemma ALTRUISM, THE PRISONER S DILEMMA, AND THE COMPONENTS OF SELECTION Abstract The n-player prisoner s dilemma (PD) is a useful model of multilevel selection for altruistic traits. It highlights the non zero-sum

More information

Research Article Snowdrift Game on Topologically Alterable Complex Networks

Research Article Snowdrift Game on Topologically Alterable Complex Networks Mathematical Problems in Engineering Volume 25, Article ID 3627, 5 pages http://dx.doi.org/.55/25/3627 Research Article Snowdrift Game on Topologically Alterable Complex Networks Zhe Wang, Hong Yao, 2

More information

Problems on Evolutionary dynamics

Problems on Evolutionary dynamics Problems on Evolutionary dynamics Doctoral Programme in Physics José A. Cuesta Lausanne, June 10 13, 2014 Replication 1. Consider the Galton-Watson process defined by the offspring distribution p 0 =

More information

Dynamic-persistence of cooperation in public good games when group size is dynamic

Dynamic-persistence of cooperation in public good games when group size is dynamic Journal of Theoretical Biology 243 (26) 34 42 www.elsevier.com/locate/yjtbi Dynamic-persistence of cooperation in public good games when group size is dynamic Marco A. Janssen a,, Robert L. Goldstone b

More information

Resource heterogeneity can facilitate cooperation

Resource heterogeneity can facilitate cooperation Supplementary information for Resource heterogeneity can facilitate cooperation Ádám Kun 1,2,3,4* & Ulf Dieckmann 1 1 Evolution and Ecology Program, International Institute for Advanced System Analysis,

More information

arxiv:q-bio/ v2 [q-bio.pe] 12 Sep 2006

arxiv:q-bio/ v2 [q-bio.pe] 12 Sep 2006 Does mobility decrease cooperation? arxiv:q-bio/689v2 [q-bio.pe] 12 Sep 26 Mendeli H. Vainstein 1, Ana Tereza Costa Silva 2 and Jeferson J. Arenzon 3 1. Instituto de Física and International Center of

More information

arxiv: v4 [cs.dm] 20 Nov 2017

arxiv: v4 [cs.dm] 20 Nov 2017 THE SPREAD OF COOPERATIVE STRATEGIES ON GRIDS WITH RANDOM ASYNCHRONOUS UPDATING CHRISTOPHER DUFFY 1 AND JEANNETTE JANSSEN 2 1 DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF SASKATCHEWAN 2 DEPARTMENT

More information

Repeated Games and Direct Reciprocity Under Active Linking

Repeated Games and Direct Reciprocity Under Active Linking Repeated Games and Direct Reciprocity Under Active Linking The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Pacheco,

More information

Supplementary Information

Supplementary Information 1 Supplementary Information 2 3 Supplementary Note 1 Further analysis of the model 4 5 6 7 8 In Supplementary Note 1 we further analyze our model, investigating condition (5) presented in the Methods under

More information

EVOLUTIONARY GAMES AND LOCAL DYNAMICS

EVOLUTIONARY GAMES AND LOCAL DYNAMICS International Game Theory Review c World Scientific Publishing Company EVOLUTIONARY GAMES AND LOCAL DYNAMICS PHILIPPE UYTTENDAELE FRANK THUIJSMAN Department of Knowledge Engineering Maastricht University

More information

Damon Centola.

Damon Centola. http://www.imedea.uib.es/physdept Konstantin Klemm Victor M. Eguíluz Raúl Toral Maxi San Miguel Damon Centola Nonequilibrium transitions in complex networks: a model of social interaction, Phys. Rev. E

More information

A Hawk-Dove game in kleptoparasitic populations

A Hawk-Dove game in kleptoparasitic populations A Hawk-Dove game in kleptoparasitic populations Mark Broom, Department of Mathematics, University of Sussex, Brighton BN1 9RF, UK. M.Broom@sussex.ac.uk Roger M. Luther, Department of Mathematics, University

More information

Evolutionary games on complex network

Evolutionary games on complex network Evolutionary games on complex network Wen-Xu Wang 1,2 and Bing-Hong Wang 1,3 1 Department of Modern Physics, University of Science and Technology of China, Hefei 230026, China 2 Department of Electronic

More information

Stochastic stability in spatial three-player games

Stochastic stability in spatial three-player games Stochastic stability in spatial three-player games arxiv:cond-mat/0409649v1 [cond-mat.other] 24 Sep 2004 Jacek Miȩkisz Institute of Applied Mathematics and Mechanics Warsaw University ul. Banacha 2 02-097

More information

arxiv: v1 [physics.soc-ph] 11 Nov 2007

arxiv: v1 [physics.soc-ph] 11 Nov 2007 Cooperation enhanced by the difference between interaction and learning neighborhoods for evolutionary spatial prisoner s dilemma games Zhi-Xi Wu and Ying-Hai Wang Institute of Theoretical Physics, Lanzhou

More information

arxiv: v1 [q-bio.pe] 22 Sep 2016

arxiv: v1 [q-bio.pe] 22 Sep 2016 Cooperation in the two-population snowdrift game with punishment enforced through different mechanisms André Barreira da Silva Rocha a, a Department of Industrial Engineering, Pontifical Catholic University

More information

Communities and Populations

Communities and Populations ommunities and Populations Two models of population change The logistic map The Lotke-Volterra equations for oscillations in populations Prisoner s dilemma Single play Iterated play ommunity-wide play

More information

Evolution of cooperation in finite populations. Sabin Lessard Université de Montréal

Evolution of cooperation in finite populations. Sabin Lessard Université de Montréal Evolution of cooperation in finite populations Sabin Lessard Université de Montréal Title, contents and acknowledgements 2011 AMS Short Course on Evolutionary Game Dynamics Contents 1. Examples of cooperation

More information

arxiv: v1 [physics.soc-ph] 3 Feb 2011

arxiv: v1 [physics.soc-ph] 3 Feb 2011 Phase diagrams for the spatial public goods game with pool-punishment Attila Szolnoki, 1 György Szabó, 1 and Matjaž Perc, 2 1 Research Institute for Technical Physics and Materials Science, P.O. Box 49,

More information

The Paradox of Cooperation Benets

The Paradox of Cooperation Benets The Paradox of Cooperation Benets 2009 Abstract It seems natural that when benets of cooperation are increasing, the share of cooperators (if there are any) in the population also increases. It is well

More information

Stability in negotiation games and the emergence of cooperation

Stability in negotiation games and the emergence of cooperation Received 3 September 23 Accepted 4 November 23 Published online 3 January 24 Stability in negotiation games and the emergence of cooperation Peter D. Taylor * and Troy Day Department of Mathematics and

More information

6 Evolution of Networks

6 Evolution of Networks last revised: March 2008 WARNING for Soc 376 students: This draft adopts the demography convention for transition matrices (i.e., transitions from column to row). 6 Evolution of Networks 6. Strategic network

More information

Anomalous metastability and fixation properties of evolutionary games on scale-free graphs

Anomalous metastability and fixation properties of evolutionary games on scale-free graphs Anomalous metastability and fixation properties of evolutionary games on scale-free graphs Michael Assaf 1 and Mauro Mobilia 2 1 Racah Institute of Physics, Hebrew University of Jerusalem Jerusalem 9194,

More information

6.207/14.15: Networks Lecture 16: Cooperation and Trust in Networks

6.207/14.15: Networks Lecture 16: Cooperation and Trust in Networks 6.207/14.15: Networks Lecture 16: Cooperation and Trust in Networks Daron Acemoglu and Asu Ozdaglar MIT November 4, 2009 1 Introduction Outline The role of networks in cooperation A model of social norms

More information

Bias-Variance Error Bounds for Temporal Difference Updates

Bias-Variance Error Bounds for Temporal Difference Updates Bias-Variance Bounds for Temporal Difference Updates Michael Kearns AT&T Labs mkearns@research.att.com Satinder Singh AT&T Labs baveja@research.att.com Abstract We give the first rigorous upper bounds

More information

WXML Final Report: Chinese Restaurant Process

WXML Final Report: Chinese Restaurant Process WXML Final Report: Chinese Restaurant Process Dr. Noah Forman, Gerandy Brito, Alex Forney, Yiruey Chou, Chengning Li Spring 2017 1 Introduction The Chinese Restaurant Process (CRP) generates random partitions

More information

Consequence of doping in spatiotemporal rock-paper-scissors games

Consequence of doping in spatiotemporal rock-paper-scissors games Consequence of doping in spatiotemporal rock-paper-scissors games Wang Zhijian Interdiscriptional Center of Social Science, Zhejiang University, 310027, China email: wangzj@zju.edu.cn Abstract What determines

More information

Cooperation Achieved by Migration and Evolution in a Multilevel Selection Context

Cooperation Achieved by Migration and Evolution in a Multilevel Selection Context Proceedings of the 27 IEEE Symposium on Artificial Life (CI-ALife 27) Cooperation Achieved by Migration and Evolution in a Multilevel Selection Context Genki Ichinose Graduate School of Information Science

More information

Major questions of evolutionary genetics. Experimental tools of evolutionary genetics. Theoretical population genetics.

Major questions of evolutionary genetics. Experimental tools of evolutionary genetics. Theoretical population genetics. Evolutionary Genetics (for Encyclopedia of Biodiversity) Sergey Gavrilets Departments of Ecology and Evolutionary Biology and Mathematics, University of Tennessee, Knoxville, TN 37996-6 USA Evolutionary

More information

arxiv: v1 [physics.soc-ph] 26 Feb 2009

arxiv: v1 [physics.soc-ph] 26 Feb 2009 arxiv:0902.4661v1 [physics.soc-ph] 26 Feb 2009 Evolution of cooperation on scale-free networks subject to error and attack Matjaž Perc Department of Physics, Faculty of Natural Sciences and Mathematics,

More information

Costly Signals and Cooperation

Costly Signals and Cooperation Costly Signals and Cooperation Károly Takács and András Németh MTA TK Lendület Research Center for Educational and Network Studies (RECENS) and Corvinus University of Budapest New Developments in Signaling

More information

Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games

Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games Satisfaction Equilibrium: Achieving Cooperation in Incomplete Information Games Stéphane Ross and Brahim Chaib-draa Department of Computer Science and Software Engineering Laval University, Québec (Qc),

More information

Evolutionary Dynamics in Structured Populations

Evolutionary Dynamics in Structured Populations Evolutionary Dynamics in Structured Populations The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Nowak, Martin A., Corina

More information

A game-theoretical approach to the analysis of microbial metabolic pathways

A game-theoretical approach to the analysis of microbial metabolic pathways A game-theoretical approach to the analysis of microbial metabolic pathways Stefan Schuster Dept. of Bioinformatics Friedrich Schiller University Jena, Germany Introduction Widely used hypothesis: During

More information

Diversity-optimized cooperation on complex networks

Diversity-optimized cooperation on complex networks Diversity-optimized cooperation on complex networks Han-Xin Yang, 1 Wen-Xu Wang, 2 Zhi-Xi Wu, 3 Ying-Cheng Lai, 2,4 and Bing-Hong Wang 1,5 1 Department of Modern Physics, University of Science and Technology

More information

Final Exam, Machine Learning, Spring 2009

Final Exam, Machine Learning, Spring 2009 Name: Andrew ID: Final Exam, 10701 Machine Learning, Spring 2009 - The exam is open-book, open-notes, no electronics other than calculators. - The maximum possible score on this exam is 100. You have 3

More information

Stochastic Heterogeneous Interaction Promotes Cooperation in Spatial Prisoner s Dilemma Game

Stochastic Heterogeneous Interaction Promotes Cooperation in Spatial Prisoner s Dilemma Game Stochastic Heterogeneous Interaction Promotes Cooperation in Spatial Prisoner s Dilemma Game Ping Zhu*, Guiyi Wei School of Computer Science and Information Engineering, Zhejiang Gongshang University,

More information

Tit-for-Tat or Win-Stay, Lose-Shift?

Tit-for-Tat or Win-Stay, Lose-Shift? Tit-for-Tat or Win-Stay, Lose-Shift? The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published Version Accessed Citable

More information

Treatment of Error in Experimental Measurements

Treatment of Error in Experimental Measurements in Experimental Measurements All measurements contain error. An experiment is truly incomplete without an evaluation of the amount of error in the results. In this course, you will learn to use some common

More information

Minimal-Agent Control of Evolutionary Games on Tree Networks

Minimal-Agent Control of Evolutionary Games on Tree Networks 21st International Symposium on Mathematical Theory of Networks and Systems July 7-11, 2014. Minimal-Agent Control of Evolutionary Games on Tree Networks James R. Riehl and Ming Cao Abstract We investigate

More information

Natal versus breeding dispersal: Evolution in a model system

Natal versus breeding dispersal: Evolution in a model system Evolutionary Ecology Research, 1999, 1: 911 921 Natal versus breeding dispersal: Evolution in a model system Karin Johst 1 * and Roland Brandl 2 1 Centre for Environmental Research Leipzig-Halle Ltd, Department

More information

The Evolution of Cooperation in Self-Interested Agent Societies: A Critical Study

The Evolution of Cooperation in Self-Interested Agent Societies: A Critical Study The Evolution of Cooperation in Self-Interested Agent Societies: A Critical Study Lisa-Maria Hofmann Karlsruhe Institute of Technology Karlsruhe, Germany lisamariahofmann@gmail.com Nilanjan Chakraborty

More information

Formalizing the gene centered view of evolution

Formalizing the gene centered view of evolution Chapter 1 Formalizing the gene centered view of evolution Yaneer Bar-Yam and Hiroki Sayama New England Complex Systems Institute 24 Mt. Auburn St., Cambridge, MA 02138, USA yaneer@necsi.org / sayama@necsi.org

More information

Evolutionary Game Theory

Evolutionary Game Theory Evolutionary Game Theory ISI 330 Lecture 18 1 ISI 330 Lecture 18 Outline A bit about historical origins of Evolutionary Game Theory Main (competing) theories about how cooperation evolves P and other social

More information

CRITICAL BEHAVIOR IN AN EVOLUTIONARY ULTIMATUM GAME WITH SOCIAL STRUCTURE

CRITICAL BEHAVIOR IN AN EVOLUTIONARY ULTIMATUM GAME WITH SOCIAL STRUCTURE Advances in Complex Systems, Vol. 12, No. 2 (2009) 221 232 c World Scientific Publishing Company CRITICAL BEHAVIOR IN AN EVOLUTIONARY ULTIMATUM GAME WITH SOCIAL STRUCTURE VÍCTOR M. EGUÍLUZ, and CLAUDIO

More information

Evolutionary Dynamics of Lewis Signaling Games: Signaling Systems vs. Partial Pooling

Evolutionary Dynamics of Lewis Signaling Games: Signaling Systems vs. Partial Pooling This version: October 8, 2006. Introduction Evolutionary Dynamics of Lewis Signaling Games: Signaling Systems vs. Partial Pooling Simon Huttegger Brian Skyrms Rory Smead Kevin Zollman In Lewis signaling

More information