Abstract
Cooperation is a relevant and controversial phenomenon in human societies. Indeed, although it is widely recognized essential for tackling social dilemmas, finding suitable policies for promoting cooperation can be arduous and expensive. More often, it is driven by preestablished schemas based on norms and punishments. To overcome this paradigm, we highlight the interplay between the influence of social interactions on networks and spontaneous selfregulating mechanisms on individuals behavior. We show that the presence of these mechanisms in a prisoner’s dilemma game, may oppose the willingness of individuals to defect, thus allowing them to behave cooperatively, while interacting with others and taking conflicting decisions over time. These results are obtained by extending the Evolutionary Game Equations over Networks to account for selfregulating mechanisms. Specifically, we prove that players may partially or fully cooperate whether selfregulating mechanisms are sufficiently stronger than social pressure. The proposed model can explain unconditional cooperation (strong selfregulation) and unconditional defection (weak selfregulation). For intermediate selfregulation values, more complex behaviors are observed, such as mutual defection, recruiting (cooperate if others cooperate), exploitation of cooperators (defect if others cooperate) and altruism (cooperate if others defect). These phenomena result from dynamical transitions among different game structures, according to changes of system parameters and cooperation of neighboring players. Interestingly, we show that the topology of the network of connections among players is crucial when selfregulation, and the associated costs, are reasonably low. In particular, a population organized on a random network with a ScaleFree distribution of connections is more cooperative than on a network with an ErdösRényi distribution, and, in turn, with a regular one. These results highlight that social diversity, encoded within heterogeneous networks, is more effective for promoting cooperation.
Similar content being viewed by others
Introduction
Cooperation in human populations is a fundamental phenomenon, which has fascinated many scientists working in different fields, such as biology, sociology, economics^{1,2,3,4,5,6}, and engineering^{7,8,9}. In biology it has been pointed out that the emergence of cooperation may be favored by the presence of kin selection, based on the altruistic behavior among relatives^{10,11}. Additionally, many theoretical approaches to understand the evolution of cooperation among nonrelatives are based on direct reciprocity; in this case it is assumed that individuals can adopt complex strategies that take into account the past history of their interactions with other individuals^{12,13}. Although the previous ones are powerful mechanisms for the evolution of cooperation, they don’t cover peculiar aspects of human behavior. Indeed, the evolution of cooperation leads to reputation building, morality judgement and complex social interactions with ever increasing cognitive demands^{14}. These mechanisms are known as indirect reciprocity^{15,16}. Other approaches for explaining the emergence of cooperation are based on the presence of norms in a society^{17,18}, punishment^{19,20,21,22,23,24}, synergy and discounting^{25}, social diversity^{26} and positive interactions^{27}. Also imitative processes, based on conformity, have been found to be effective in the promotion of cooperation within a population^{28}.
All the aforementioned approaches are based on mathematical models which assume that interactions among players, as well as the update rules of strategies, e.g. when switching between cooperation and defection, are stochastic, and the time evolution of players behavior is described by random variables, e.g. birthdeath mechanisms^{12} or payoff optimization through imitation^{29}. Specifically, in these models individuals are constrained to choose between cooperation (\(C\)) and defection (\(D\)) in a prisoner’s dilemma scenario. Accordingly, the replicator equation is a widely used mathematical model, which represents a deterministic setting ruling the time evolution of the probability distribution of strategies over a wellmixed infinite population^{30,31}. However, when dealing with real systems, cooperation may gradually evolve starting from discrete (\(C\) or \(D\)) or fuzzy (intermediate values between \(C\) and \(D\)) initial conditions. In this regard, the continuous prisoner’s dilemma has been proposed as a representative model able to account for different levels of cooperation^{3,32,33}.
Moreover, the presence of graphs of connections among players is typical for real populations, where asymmetric relationships are frequently observed. The evolution of strategies on graphs has been investigated in several studies^{34,35,36,37,38,39,40,41,42}. Among them, the replicator equation on regular infinite graphs, embedding network reciprocity, has been developed and analyzed in^{15,43,44}. Interestingly, the population structure can be assumed to be the result of reputationdriven mechanisms, thus inducing feedbacks favoring the cooperation among individuals^{45}.
Recently, the equation for evolutionary game on networks (EGN) has been introduced^{46,47} for modeling the deterministic dynamics of a finite networked population of individuals able to choose strategies in a continuous set. In this framework, people continuously interact over time with all their neighbors, and thus they are able to learn from their environment, composed by friends, colleagues, relatives, and so on. The tools introduced in these papers allow to analyze the dynamics of any single player, and to study more heterogeneous situations, where the initial configuration of the individuals includes partial cooperation. At the same time, the presence of a network of connections among the members of the population introduces some constraints influencing their interactions with neighbors.
In this paper, in order to study the global or partial emergence of cooperation in human societies, we propose to extend the EGN equation described above by introducing selfregulating processes. In cell communication, for example, selfregulation refers to several control mechanisms, such as signal pathways^{48} and quorum sensing^{49}, aimed to maintain the healthy state of living systems. Specifically, inspired by^{9,50}, where the importance of internal mechanisms in animal societies is discussed, an additional term is added to the EGN equation, accounting for the presence of feedbacks, acting at the level of any single individual. This integration is in agreement with the fact that “humans seem to have an innate tendency to cooperate with one another even when it goes against their rational selfinterest^{51}”. This characteristic is also recognized as a key factor for explaining the human response to monetary rewards or punishments, where the selfinterest is not the only mechanism for decision making^{52}.
However, selfregulating mechanisms, encoded by this innate tendency to cooperate, may be in conflict with social pressure. In fact, the presence of conflicts in human decision processes is widely recognized, as reported by Bear and Rand^{53}: “In many situations, intuitive and deliberative processes can favor different decisions, leading to inner conflict: Rather than being of a single mind, people are torn between competing desires”.
The extended EGN allows us to study theoretically the emergence of cooperation as the result of the conflict between spontaneous internal factors and social pressure perceived by the members of a social interconnected system. The influence of the network topology is also investigated by extensive simulations.
The model
Consider a social interconnected system defined by a finite population of players \(v=\{1,\ldots ,N\}\) connected through an undirected graph with adjacency matrix \({\bf{A}}=\{{a}_{v,w}\}\). \({\bf{A}}\) is a symmetric \(N\times N\) matrix where \({a}_{v,w}=1\) if player \(v\) is connected to player \(w\), and 0 otherwise. The degree \({k}_{v}={\sum }_{w=1}^{N}{a}_{v,w}\) of player \(v\) corresponds to the size of his neighborhood. At each time instant, an individual \(v\) will play \({k}_{v}\) continuous prisoner’s dilemma games with his neighbors, thus choosing his own level of cooperation, indicated by \({x}_{v}\in [0,1]\). Pure strategies \(C\) and \(D\) correspond to \({x}_{v}=1\) and \({x}_{v}=0\), respectively. The replicator dynamics describing this mechanism for two strategies is incorporated by the EGN equation^{46,47}, which can be expressed as:
where the function \({\phi }_{v}\) represents the payoff of player \(v\) over the network, thus accounting for the sum of all outcomes of the \({k}_{v}\) twoplayers games played by \(v\) with neighbors (refer to the SI document for further details):
where the vector \({\bf{x}}={[{x}_{1},{x}_{2},\ldots ,{x}_{N}]}^{\top }\) represents the strategy profile of the whole population, while \(\phi ({x}_{v},{x}_{w})\) is the payoff earned by player \(v\) against \(w\) when they use strategies \({x}_{v}\) and \({x}_{w}\), respectively. In the specific case of the continuous prisoner’s dilemma game^{33}, the payoff function \(\phi \) is the following:
where \(R\) is the reward for mutual cooperation, \(T\) is the temptation to defect when the opponent cooperates, \(S\) is the sucker’s payoff earned by a cooperative player when the opponent is a free rider, and \(P\) is the punishment for mutual defection. The social dilemma arises when the temptation to defect is stronger than the reward for cooperation (\(T > R\)), and the punishment for defection is preferred to the sucker’s payoff (\(P > S\)). Moreover, \(P\) is lower than \(R\). Without loss of generality, we assume \(R=1\) and \(P=0\), thereby normalizing the advantage of mutual cooperation over mutual defection^{29}. Under these assumptions, \(T > 1\) and \(S < 0\), and the payoff function \(\phi \) reads as follows:
Therefore, the derivative of \({\phi }_{v}\) with respect to \({x}_{v}\), introduced in (1), is:
Unlike the standard replicator equation, which deals with the distribution of strategies over a well mixed population of players, indistinguishable from one another except for the strategy chosen, the EGN equation (1) is a system of ODEs, each one describing the strategy evolution of a single player \(v\), able to appraise whether a change of his strategy \({x}_{v}\) produces a variation of his own payoff \({\phi }_{v}\). Notice that, since in (1) \({x}_{v}(1{x}_{v})\ge 0\), the sign of \({\dot{x}}_{v}\) depends only on the term \(\partial {\phi }_{v}/\partial {x}_{v}\), which involves the states \({x}_{w}\) of all neighbors, rather than the current state \({x}_{v}\) of player \(v\) himself. Then, if this term is positive (negative), player \(v\) would like to increase (decrease) his level of cooperation \({x}_{v}\). Of course, when it is null, player \(v\) has no incentives to change his mind. In the strict formulation of the prisoner’s dilemma game, unilateral defection is preferred to mutual cooperation, i.e. \(T > 1\), and mutual defection overcomes unilateral cooperation, i.e. \(S < 0\)^{29,30,54}. Consequently, in (1), \(\partial {\phi }_{v}/\partial {x}_{v}\le 0\), then \({\dot{x}}_{v}\le 0\), showing that the level of cooperation eventually decreases over time towards full defection.
The willingness to pursue cooperation as a greater good may follow from internal mechanisms correlated to personal awareness and culture^{51}, contrasting with the aforementioned selfish processes, which ultimately lead to defection. Reasonably, these mechanisms depend on the current strategy \({x}_{v}\) of player himself, and act as inertial terms, which reduce the rational temptation to defect. Inspired by the behavior observed in animal societies^{9,50}, we consider an internal mechanism, named selfregulation, defined by the term \({\beta }_{v}\,{f}_{v}({x}_{v})\), where \({f}_{v}({x}_{v})\) accounts for selfregulation itself, and \({\beta }_{v}\) measures its strength. Selfregulation is meant to balance the external mechanisms \(\partial {\phi }_{v}/\partial {x}_{v}\), which in turn indicate the effects of social influence. Notice that, for \({\beta }_{v}=0\), the standard EGN equation is recovered.
The extended SelfRegulated EGN equation, hereafter called SREGN, is reported in Fig. 1. A natural way for defining the function \({f}_{v}\) is to model the selfregulation term as a virtual game that each individual plays against himself, a selfgame. For this reason, the game can be a Prisoner’s dilemma game, characterized by the same parameters \(T\) and \(S\):
In the SREGN equation, positive values of \({\beta }_{v}\) cause an “aware resistance” against the temptation to defect, thus activating a conflict between internal and external mechanisms. Negative values of \({\beta }_{v}\) are not considered since they foster the defective prisoner’s dilemma dynamics. The interplay between social influence and selfregulation constitutes an intuitive explanation of the theoretical results formally proved in the SI document and hereafter schematically presented.
Results
It is worthwhile to notice that SREGN equation can be rewritten as follows:
where \({\bar{x}}_{v}=(1/{k}_{v}){\sum }_{w=1}^{N}{a}_{v,w}{x}_{w}\) represents the equivalent player, which incorporates the average decisions of the neighbors of player \(v\). Since the SREGN depends on the difference of terms (4) and (5), their comparison allows us to evaluate the relationship between social influence and selfregulation by means of selfregulation strength \({\beta }_{v}\) and degree \({k}_{v}\) of player \(v\). We prove the following result.
Main result 1. If for each player selfregulation is stronger than connectivity, \({\beta }_{v} > {k}_{v}\), then the fully cooperative configuration \({{\bf{x}}}_{ALLC}^{\ast }={[1,1,\ldots ,1]}^{\top }\) is an attractor for the system dynamics, while at the same time total defection \({{\bf{x}}}_{ALLD}^{\ast }={[0,0,\ldots ,0]}^{\top }\) is repulsive.
These stability and instability properties of \({{\bf{x}}}_{ALLC}^{\ast }\) and \({{\bf{x}}}_{ALLD}^{\ast }\) have been formally proved by using linear stability theory (see Theorems 3 and 4 of the SI document). Stronger results highlight the relationship among global stability of \({{\bf{x}}}_{ALLC}^{\ast }\), initial conditions, and payoffs \(T > 1\) and \(S < 0\). To this aim, it is useful to introduce the parameter \(\rho \ge 1\):
When the effect of \(T\) is enough stronger than \(S\), the game is driven by the temptation to defect (Tdriven). Accordingly, in this case \(\rho =(1T)/S\). On the other hand, when the effect of \(S\) is stronger than \(T\), then the game is driven by the fear to be betrayed (Sdriven). In this case, \(\rho =S/(1T)\). In both Tdriven and Sdriven cases, \(\rho \ge 1\). Further details can be found in the SI document. The parameter \(\rho \) is involved in the following results concerning the global stability of \({{\bf{x}}}_{ALLC}^{\ast }\) and \({{\bf{x}}}_{ALLD}^{\ast }\). The proofs, based on finding suitable nonlinear functions satisfying the Lyapunov stability theory, are given in Theorems 5 and 6 of the SI document.
Main result 2. If, for each player \(v\), \({\beta }_{v} > {k}_{v}\rho \) , then \({{\bf{x}}}_{ALLC}^{\ast }\) is a global attractor for any initial strategy \({x}_{v}(0)\in (0,1]\), thus all members of the population will be eventually cooperators.
Main result 3. If, for each player \(v\) , \({\beta }_{v} < {k}_{v}/\rho \), then \({{\bf{x}}}_{ALLD}^{\ast }\) is a global attractor for any initial strategy \({x}_{v}(0)\in [0,1)\), thus all members of the population will be eventually defectors.
Therefore, under stronger conditions than the one assumed in Main result 1, \({{\bf{x}}}_{ALLC}^{\ast }\) is globally attractive and \({{\bf{x}}}_{ALLD}^{\ast }\) is globally repulsive.
The previous results are related to the global emergence of cooperation, arising when all members of a networked population turn their strategies to cooperation. However, cooperation can partially emerge; for example, some players may exhibit partial levels of cooperation.
Let \({\mathscr{C}}=\{w:{\beta }_{w} > {k}_{w}\rho \}\) be the set of players which satisfy Main result 2, thus, if \(v\in {\mathscr{C}}\), then \({x}_{v}(+\infty )=1\) for any initial condition \({x}_{v}(0)\in (0,1]\). Let \({\mathscr{D}}=\{w:0\le {\beta }_{w} < {k}_{w}/\rho \}\) be the set of players satisfying Main result 3. If \(v\in {\mathscr{D}}\), then \({x}_{v}(+\infty )=0\), independently on the initial condition \({x}_{v}(0)\in [0,1)\). The dynamics of individuals in both these sets are also independent on the behavior of any other player of the population.
Interestingly, a richer set of unexpected behaviors is observed for the uncertain players, belonging to the set \({\mathscr{U}}=\{w:{k}_{w}/\rho \le {\beta }_{w}\le {k}_{w}\rho \}\), for which it is not guaranteed that \({x}_{v}(+\infty )=1\), nor \({x}_{v}(+\infty )=0\). The dynamics of these individuals has been investigated by means of extensive numerical experiments.
First of all, in Fig. 2 some prototypical examples of the asymptotic dynamics and the corresponding flows of uncertain players are reported. The solutions have been obtained by solving the ODE system (6) through an explicit RungeKutta (4,5) formula^{55}. This numerical method has been used for all simulations reported in this paper. In the subplots 2A.1, 2B.1, 2C.1 and 2D.1, assuming that the equivalent player reached a fully cooperative (\({\bar{x}}_{v}=1\)) or fully defective (\({\bar{x}}_{v}=0\)) steady state, and for a constant value of \({k}_{v}\), the value of \({\dot{x}}_{v}\) is drawn with different colors, according to the values of \({\beta }_{v}\) and \({x}_{v}\). In the same figures, the attracting (black circles) and repulsive (white circles) steady states of \({x}_{v}\) are depicted. One can notice that in a Tdriven prisoner’s dilemma game (subplots 2A.1 and 2B.1) there are repulsive partially cooperative equilibria \({x}_{v}^{\ast }\). These equilibria separate the phase space as thresholds, thus giving rise to a bistable dynamics leading player to full cooperation or full defection, for any initial condition \({x}_{v}(0)\in (0,1)\backslash \{{x}_{v}^{\ast }\}\). Existence and feasibility of partially cooperative equilibria are discussed in Theorems 1 and 2 of the SI document. Moreover, by increasing \({\bar{x}}_{v}\) from 0 to 1, the green area reduces, thus decreasing the probability for individuals to be cooperative.
The time courses \({x}_{v}\) of player \(v\) (red line) interacting with unconditional defective or unconditional cooperative equivalent players \({\bar{x}}_{v}\) (blue line), are depicted in the second and third columns of Fig. 2, where, for example, we observe the onset of reciprocity mechanisms, for which \(v\) defects if his neighborhood defects (subplot 2A.2) or \(v\) cooperates if his neighborhood cooperates (subplot 2B.3). Interestingly, also antireciprocal behaviors arise: \(v\) may cooperate if others defect, as shown in subplot 2A.3. In this case, the absence of cooperators in the neighborhood to be exploited, makes \(v\) aware on the importance of being cooperative. On the contrary, the abundance of cooperators in the neighborhood may lead player \(v\) towards defection, in order to exploit nearby players (subplot 2B.2).
For the Sdriven games (subplots 2C.1 and 2D.1), the partially cooperative steady states \({x}_{v}^{\ast }\) are attractive, thus ensuring that players \(v\in {\mathscr{U}}\) will reach at least a partial level of cooperation. Interestingly, since the punishment effect is strong, the presence of cooperators in the neighborhood facilitates the convergence to a cooperative state. Specifically, if \({\bar{x}}_{v}\) moves from 0 (subplot 2C.1) to 1 (subplot 2D.1), the probability for a player to be cooperative increases. Subplots 2C.2–2C.3, and 2D.2–2D.3 depict some examples of the time course of the solutions when playing against unconditional defective or unconditional cooperative equivalent players. Reciprocity mechanisms are observed also for the Sdriven case, for example, defectordefector (subplot 2C.2), partially cooperatorcooperator (subplot 2D.2), cooperatorcooperator (subplot 2D.3). Finally, Fig. 2C.3 shows an antireciprocal behavior, where \(v\) partially cooperates when the neighborhood defects.
In addition to the local dynamics of players, the global behavior of the system is studied by investigating the distribution of cooperation over the whole population. To this aim, extensive simulations have been run using random networks with ErdösRényi and ScaleFree degree distributions. For each model, 500 networks of \(N=1000\) nodes have been generated, with average degree \(\bar{k}=10\). The the SREGN equation has been simulated with random initial conditions, assuming that all individuals share the same selfregulating factor \({\beta }_{v}=\beta \). In Fig. 3 the resulting percentages of full defectors (red areas), partial cooperators (orange areas) and full cooperators (yellow areas) at steady state are reported for both the Tdriven and Sdriven games and different values of \(\beta \in \{0,\ldots ,20\}\). Color intensities are used to distinguish the sets \({\mathscr{D}},{\mathscr{U}}\) and \({\mathscr{C}}\): dark red areas indicate the individuals in class \({\mathscr{D}}\) and dark yellow the individuals in class \({\mathscr{C}}\). As expected from the theoretical results, increasing \(\beta \) produces an increase of the number of cooperators.
Anyway, Fig. 3 clearly shows that uncertain individuals \(v\in {\mathscr{U}}\) are also able to cooperate (light yellow areas), partially cooperate in the Sdriven game (orange areas in subplots 3B and 3D) or defect (light red areas), thus showing that cooperation is possible also for lower values of \(\beta \). This is very important in real applications, because the high values of \(\beta \) required by the theoretical results are usually associated to high costs for the individuals.
Finally, we notice that this phenomenon is stronger for the ScaleFree than for the ErdösRényi networks, thus suggesting that the heterogeneity of a network is highly effective in promoting cooperation. Furthermore, the average convergence speed of the system to a steady state, reported by blue lines in Fig. 3, changes with \(\beta \). In particular, it decreases for small \(\beta \)s, due to the transition from all defectors to a mixed situation, where cooperators and defectors coexist. Finally, when the number of cooperators dominate the population, the speed increases again.
Game transitions
A significant result of this study is that selfregulation induces game transitions, resulting from changes in the structure of the underlying games. To explain this phenomenon, we calculate the equivalent game of player \(v\) and we find that parameter \(\rho \), player’s degree \({k}_{v}\), selfregulating strength \({\beta }_{v}\), as well as the strategy of the equivalent player \({\bar{x}}_{v}\), are responsible for these transitions (see the SI document for technical details).
A short recap on two strategy games is useful. Four game typologies are possible: PD game, where defection is the only dominant strategy; Stag Hunt game (SH), where cooperation (defection) is the best response to cooperation (defection); Chicken game (CH), where cooperation is the best response to defection, and vice versa; Harmony game (HA), where cooperation is the only dominant strategy.
In the SREGN equation, player \(v\) is an unconditional defector when \({\beta }_{v} < {k}_{v}/\rho \). Indeed he belongs to \({\mathscr{D}}\) and his equivalent game is still a PD. On the other hand, player \(v\) is an unconditional cooperator when \({\beta }_{v} > {k}_{v}\rho \). In this case, he belongs to \({\mathscr{C}}\), and the equivalent game played by player \(v\) is now HA. Notice that in both situations, the equivalent game does not depend on the behavior of the equivalent player \({\bar{x}}_{v}\).
In the intermediate region \({\mathscr{U}}\), the dynamics of player \(v\) is uncertain, and transitions may dynamically occur since the equivalent game is also influenced by the behavior of the neighboring players. In the Tdriven case, when \({k}_{v}/\rho < {\beta }_{v} < {k}_{v}\), as \({\bar{x}}_{v}\) decreases, the temptation of \(v\) to defect is reduced, and thus transitions from PD to SH games are observed. Instead, for increasing values of \({\bar{x}}_{v}\), transitions from SH to PD occur. Similarly, when \({k}_{v} < {\beta }_{v} < {k}_{v}\rho \), as \({\bar{x}}_{v}\) decreases, the fear of player \(v\) to be betrayed is reduced, thus transitions from SH to HA games are observed. Conversely, for increasing values of \({\bar{x}}_{v}\), transitions from HA to SH arise. For the Sdriven case, when \({k}_{v}/\rho < {\beta }_{v} < {k}_{v}\), the observed transitions are from PD to CH games when the equivalent player \({\bar{x}}_{v}\) increases his cooperation. Indeed, this raise is able to inhibit the player \(v\)’s fear to be betrayed. Finally, when \({k}_{v} < {\beta }_{v} < {k}_{v}\rho \), \(v\) moves from a CH to a HA game as \({\bar{x}}_{v}\) increases; the transition is due to the inhibition of the temptation of \(v\) to defect. All the described phenomena dynamically occur, provided that cooperation \({\bar{x}}_{v}\) varies enough.
These results are summarized schematically in Fig. 4, confirming the antireciprocal (reciprocal) behaviors already discussed for the Tdriven (Sdriven) case.
Additionally, we remark that the parameter \(\rho \) plays a role for the emergence of cooperation in the group of the uncertain players. Indeed, the size \({k}_{v}(\rho 1/\rho )\) of the interval \({{\mathscr{U}}}_{v}=\{{\beta }_{v}:v\in {\mathscr{U}}\}=[{k}_{v}/\rho ,{k}_{v}\rho ]\) is larger as \(\rho \) increases, thus favoring the onset of game transitions and concurring to explain better the results shown in Fig. 3, for which the cooperation depends mainly on uncertain players.
The role of network structure
As aforementioned, the network structure plays a significant role for the emergence of cooperation. Fig. 5 shows the average cooperation of the whole population, calculated as \(\widehat{x}=\frac{1}{NI}{\sum }_{i=1}^{I}{\sum }_{v=1}^{N}{x}_{v}(\infty )\), where \(I=500\) is the number of random instances of the experiment, which include network generation and initial conditions. In all simulations, \({\beta }_{v}=\beta =5\). The behavior of \(\widehat{x}\) is reported in the subplots 5A (Tdriven) and 5B (Sdriven), by varying \(\bar{k}\) in \(\{2,4,\ldots ,12\}\), for regular (magenta), ErdösRényi (green) and ScaleFree (blue) networks. Subplots 5C and 5D report the average cooperation \({\widehat{x}}_{{\mathscr{U}}}\) of the subpopulation of uncertain players \(v\in {\mathscr{U}}\).
Interestingly, except for very small values of \(\bar{k}\), random networks, and especially the ScaleFree networks, foster cooperation more than regular ones. This fact is more relevant for the subset of uncertain players (subplots 5C and 5D), suggesting that these players have a crucial role for cooperation.
The presented model allows to study the dynamics of every member of the population, thus enabling to observe whether an individual is changing opinion over time. Moreover, we are interested in understanding the relationship between the dynamics of each individual and that of his equivalent player, thus highlighting different possible behaviors, such as mutual defection, recruiting (cooperate if others cooperate), exploitation of cooperators (defect if others cooperate) and altruism (cooperate if others defect). In order to quantify the difference between the level of cooperation of player \(v\) and the average cooperation of his neighbors at steady state, the following indicator is introduced:
If \({c}_{v}\simeq 0\), the player exhibits mutual behavior. On the contrary, for \({c}_{v}\) sufficiently different from 0, we observe opposite behaviors. Specifically, if \({c}_{v} > 0\), then player \(v\) shows altruism, since his level of cooperation is higher than the average of his neighbors, while \({c}_{v} < 0\) indicates exploitation of cooperators.
Under the same experimental setup used for Fig. 5, Fig. 6 reports a dot for each player, representing the combination of the value \({c}_{v}\) (\(x\)axis) and his degree \({k}_{v}\) (\(y\)axis). Moreover, the color of each dot corresponds to the degree \({k}_{v}\) of player \(v\), thus allowing to distinguish between cooperative players in class \({\mathscr{C}}\) (green dots), uncertain players in class \({\mathscr{U}}\) (blue dots) and defective players in class \({\mathscr{D}}\) (magenta dots). The selfregulation parameter \(\beta \) is set to 10 for all players. The black lines in Fig. 6 represent the distribution over the whole population of the indicator \({c}_{v}\). Players exhibiting mutual behavior are mainly present in the Sdriven games, as reported by black lines in subplots 6B and 6D. In the Tdriven case, the population mainly shows oppositing behaviors, and it is split into two groups composed by altruistic and selfish players, respectively (subplots 6A and 6C). It is worthwhile to notice that altruistic players (\({c}_{v} > 0\)) belong to classes \({\mathscr{C}}\) and \({\mathscr{U}}\), thus showing a low/intermediate level of connectivity within the network, while selfish players (\({c}_{v} < 0\)) belong to class \({\mathscr{D}}\), where the connectivity is high. Moreover, while the distribution of \({c}_{v}\) values is symmetric with respect to 0 for the ErdösRényi networks, as shown in subplots 6A and 6B, it is asymmetric when the network of connections is Scalefree, as reported in subplots 6C and 6D. In fact, Scalefree networks include a higher number of altruistic players as they present a high number of lowly connected players, which concur to activate reciprocal mechanisms.
Joining the results of Figs. 2, 3, 5 and 6, we conclude that some individuals are more sensitive and aware of their internal mechanisms, thus becoming cooperative for lower selfregulating factors, and exhibiting a more altruistic behavior. In particular, for the Sdriven game, these receptive individuals catalyze the others to cooperate.
Discussion
This paper proposes the analysis of the interplay between social influence and selfregulating mechanisms in continuous models describing the strategic interactions among the members of a networked population. The EGN equation has been appropriately extended to account for a selfregulation feedback, thus giving rise to the SREGN equation, which activates stable processes opposing the natural tendency towards defection, typical of the prisoner’s dilemma game. Theoretical results ensure that cooperation globally emerges in the extended model, whether selfregulation is stronger than social pressure. Similarly, low selfregulation will let defection spreading out all over the population.
The theoretical results presented in this study are based on the stability analysis of steady states, representing the full or partial cooperative or defective asymptotic behavior of the individuals. The time required for the individuals to reach cooperative states has been also investigated.
From a practical perspective, we found that for intermediate levels of selfregulation, cooperation may partially emerge as the result of different mechanisms: cooperative reciprocity, which activates a recruiting process, and cooperative antireciprocity (altruism) arising from the awareness of individuals. These results are coherent with the occurrence of game transitions. Numerical simulations show that the recruiting process is mostly driven by lowly connected neighbors, while awareness mechanisms are prominently caused by highly connected neighbors. Coherently, we find that the ScaleFree topologies are the most cooperative. Indeed, on one hand, they naturally present a high number of lowly connected players, which concur to activate reciprocal mechanisms, while the typical presence of highly connected players (hubs) activates the antireciprocal mechanisms. On the other hand, the ErdösRényi topologies are less cooperative since they present approximately the same number of lowly and highly connected neighbors. Additionally, the regular networks are in general the least cooperative since the distinction between lowly and highly connected players vanishes. Hence, it can be concluded that cooperation is more likely in heterogeneous network structures.
We want also to highlight that the presence of selfregulation mechanisms entails some costs, which can be reasonably proportional to parameter \(\beta \). This means that a policy based on the theoretical results reported in this work guarantees that a certain amount of people will unconditionally cooperate, and that, at the same time, they will produce higher costs for the society. The good news is that the same level of cooperation can be achieved by using lower values of \(\beta \), relying on the spontaneous emerging and learning processes of recruiting and awareness, thus reducing significantly the social impact. Heterogeneous populations connected by a ScaleFree connection structure are able to additionally foster the emergence of this “lowcost” cooperation.
In the present work a homogeneous assignment of game parameters \(T\) and \(S\) to each member of the population is assumed. This choice is motivated for easing the understanding of the selfregulating mechanisms. Anyway, the SREGN equation naturally incorporates the possibility of assuming more heterogeneous setup, such as opponentspecific payoffs, as well as different selfgame structures. Future efforts will be devoted to investigate these cases.
References
Hammerstein, P. et al. Genetic and cultural evolution of cooperation (MIT press, 2003).
Nowak, M. A. & Sigmund, K. Evolutionary dynamics of biological games. Science 303, 793–799 (2004).
Doebeli, M., Hauert, C. & Killingback, T. The evolutionary origin of cooperators and defectors. Science 306, 859–862 (2004).
Gintis, H.et al. Moral sentiments and material interests: The foundations of cooperation in economic life, vol. 6 (MIT press, 2005).
Pennisi, E. On the origin of cooperation. Science 325, 1196–1199 (2009).
Rand, D. G. & Nowak, M. A. Human cooperation. Trends Cogn. Sci. 17, 413–425 (2013).
Cao, Y., Yu, W., Ren, W. & Chen, G. An overview of recent progress in the study of distributed multiagent coordination. IEEE T. Ind. Inform. 9, 427–438 (2013).
Toupo, D. F., Strogatz, S. H., Cohen, J. D. & Rand, D. G. Evolutionary game dynamics of controlled and automatic decisionmaking. Chaos 25, 073120 (2015).
Gray, R., Franci, A., Srivastava, V. & Leonard, N. E. Multiagent decisionmaking dynamics inspired by honeybees. IEEE T. Contr. Netw. Syst. 5, 793–806 (2018).
West, S. A., Pen, I. & Griffin, A. S. Cooperation and competition between relatives. Science 296, 72–75 (2002).
Foster, K. R., Wenseleers, T. & Ratnieks, F. L. Kin selection is the key to altruism. Trends Ecol. Evol. 21, 57–60 (2006).
Nowak, M. A., Sasaki, A., Taylor, C. & Fudenberg, D. Emergence of cooperation and evolutionary stability in finite populations. Nature 428, 646–650 (2004).
Delton, A. W., Krasnow, M. M., Cosmides, L. & Tooby, J. Evolution of direct reciprocity under uncertainty can explain human generosity in oneshot encounters. Proc. Natl. Acad. Sci. 108, 13335–13340 (2011).
Nowak, M. A. & Sigmund, K. Evolution of indirect reciprocity. Nature 437, 1291–1298 (2005).
Nowak, M. A. Five rules for the evolution of cooperation. Science 314, 1560–1563 (2006).
Wang, Z. et al. Onymity promotes cooperation in social dilemma experiments. Sci. Adv. 3, e1601444 (2017).
Fehr, E. & Fischbacher, U. Social norms and human cooperation. Trends Cogn. Sci. 8, 185–190 (2004).
Hauert, C., Traulsen, A., Brandt, H., Nowak, M. A. & Sigmund, K. Via freedom to coercion: the emergence of costly punishment. Science 316, 1905–1907 (2007).
Fehr, E. & Gächter, S. Altruistic punishment in humans. Nature 415, 137–140 (2002).
Brandt, H., Hauert, C. & Sigmund, K. Punishment and reputation in spatial public goods games. Proc. R. Soc. Ser. BBio. 270, 1099–1104 (2003).
Boyd, R., Gintis, H. & Bowles, S. Coordinated punishment of defectors sustains cooperation and can proliferate when rare. Science 328, 617–620 (2010).
Helbing, D. & Johansson, A. Cooperation, norms, and revolutions: a unified gametheoretical approach. PloS One 5, e12530 (2010).
Rand, D. G. & Nowak, M. A. The evolution of antisocial punishment in optional public goods games. Nat. Commun. 2, 1–7 (2011).
Li, X. et al. Punishment diminishes the benefits of network reciprocity in social dilemma experiments. Proc. Natl. Acad. Sci. 115, 30–35 (2018).
Hauert, C., Michor, F., Nowak, M. A. & Doebeli, M. Synergy and discounting of cooperation in social dilemmas. J. Theor. Biol. 239, 195–202 (2006).
Santos, F. C., Santos, M. D. & Pacheco, J. M. Social diversity promotes the emergence of cooperation in public goods games. Nature 454, 213–216 (2008).
Rand, D. G., Dreber, A., Ellingsen, T., Fudenberg, D. & Nowak, M. A. Positive interactions promote public cooperation. Science 325, 1272–1275 (2009).
Yang, H. X. & Tian, L. Enhancement of cooperation through conformitydriven reproductive ability. Chaos Soliton. Fract. 103, 159–162 (2017).
Santos, F. C., Pacheco, J. M. & Lenaerts, T. Evolutionary dynamics of social dilemmas in structured heterogeneous populations. Proc. Natl. Acad. Sci. 103, 3490–3494 (2006).
Weibull, J. W. Evolutionary game theory (MIT press, 1997).
Hofbauer, J. & Sigmund, K. Evolutionary games and population dynamics (Cambridge University press, 1998).
Killingback, T., Doebeli, M. & Knowlton, N. Variable investment, the continuous prisoner’s dilemma, and the origin of cooperation. Proc. R. Soc. Ser. BBio. 266, 1723–1728 (1999).
Zhong, W., Kokubo, S. & Tanimoto, J. How is the equilibrium of continuous strategy game different from that of discrete strategy game? BioSystems 107, 88–94 (2012).
Santos, F. C. & Pacheco, J. M. Scalefree networks provide a unifying framework for the emergence of cooperation. Phys. Rev. Lett. 95, 098104 (2005).
Lieberman, E., Hauert, C. & Nowak, M. A. Evolutionary dynamics on graphs. Nature 433, 312–316 (2005).
Dall’Asta, L., Marsili, M. & Pin, P. Collaboration in social networks. Proc. Natl. Acad. Sci. 109, 4395–4400 (2012).
GómezGardeñes, J., Reinares, I., Arenas, A. & Floría, L. M. Evolution of cooperation in multiplex networks. Sci. Rep. 2, 620 (2012).
Rand, D. G., Nowak, M. A., Fowler, J. H. & Christakis, N. A. Static network structure can stabilize human cooperation. Proc. Natl. Acad. Sci. 111, 17093–17098 (2014).
Hilbe, C., Wu, B., Traulsen, A. & Nowak, M. A. Cooperation and control in multiplayer social dilemmas. Proc. Natl. Acad. Sci. 111, 16425–16430 (2014).
Adami, C., Schossau, J. & Hintze, A. Evolutionary game theory using agentbased methods. Phys. Life Rev. 19, 1–26 (2016).
Allen, B. et al. Evolutionary dynamics on any population structure. Nature 544, 227–230 (2017).
Melamed, D., Harrell, A. & Simpson, B. Cooperation, clustering, and assortative mixing in dynamic networks. Proc. Natl. Acad. Sci. 115, 951–956 (2018).
Ohtsuki, H., Hauert, C., Lieberman, E. & Nowak, M. A. A simple rule for the evolution of cooperation on graphs and social networks. Nature 441, 502–505 (2006).
Ohtsuki, H. & Nowak, M. A. The replicator equation on graphs. J. Theor. Biol. 243, 86–97 (2006).
Yang, H. X. & Wang, Z. Promoting cooperation by reputationdriven group formation. J. Stat. MechTheory E. 2017, 023403 (2017).
Madeo, D. & Mocenni, C. Game interactions and dynamics on networked populations. IEEE T. Automat. Contr. 60, 1801–1810 (2015).
Iacobelli, G., Madeo, D. & Mocenni, C. Lumping evolutionary game dynamics on networks. J. Theor. Biol. 407, 328–338 (2016).
Tomlin, C. J. & Axelrod, J. D. Biology by numbers: mathematical modelling in developmental biology. Nat. Rev. Genet. 8, 331–340 (2007).
PérezVelázquez, J., Gölgeli, M. & GarcíaContreras, R. Mathematical modelling of bacterial quorum sensing: a review. B. Math. Biol. 78, 1585–1639 (2016).
Schuster, P., Sigmund, K., Hofbauer, J., Gottlieb, R. & Merz, P. Selfregulation of behaviour in animal societies. Biol. Cybern. 40, 17–25 (1981).
Vogel, G. The evolution of the golden rule. Science 303, 1128–1131 (2004).
Bowles, S. The moral economy: Why good incentives are no substitute for good citizens (Yale University Press, 2016).
Bear, A. & Rand, D. G. Intuition, deliberation, and the evolution of cooperation. Proc. Natl. Acad. Sci. 113, 936–941 (2016).
Wang, Z., Kokubo, S., Jusup, M. & Tanimoto, J. Universal scaling for the dilemma strength in evolutionary games. Phys. Life Rev. 14, 1–30 (2015).
Dormand, J. R. & Prince, P. J. A family of embedded RungeKutta formulae. J. Comput. Appl. Math. 6, 19–26 (1980).
Acknowledgements
This study was partially supported by grant PORFESR 20142020 “Impresa R&S 4.0” of Tuscany Region (Italy). C.M. was partially supported by grant 313773/20130 of the Science without Borders Program of CNPq/Brazil.
Author information
Authors and Affiliations
Contributions
D.M. and C.M. equally contributed to all the aspects of the study.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Madeo, D., Mocenni, C. Selfregulation versus social influence for promoting cooperation on networks. Sci Rep 10, 4830 (2020). https://doi.org/10.1038/s41598020616347
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598020616347
This article is cited by

Studying topic engagement and synergy among candidates for 2020 US Elections
Social Network Analysis and Mining (2022)

Modeling pluralism and selfregulation explains the emergence of cooperation in networked societies
Scientific Reports (2021)
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.