اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCooperation in changing environments: Irreversibility in the transition to cooperation in networks
168
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In the framework of the evolutionary dynamics of the Prisoners Dilemma game on complex networks, we investigate the possibility that the average level of cooperation shows hysteresis under quasi-static variations of a model parameter (the temptation to defect). Under the discrete replicator strategy updating rule, for both Erdos-Renyi and Barabasi-Albert graphs we observe cooperation hysteresis cycles provided one reaches tipping point values of the parameter; otherwise, perfect reversibility is obtained. The selective fixation of cooperation at certain nodes and its organization in cooperator clusters, that are surrounded by fluctuating strategists, allows the rationalization of the lagging behind behavior observed.
قيم البحث
اقرأ أيضاً
Networks determine our social circles and the way we cooperate with others. We know that topological features like hubs and degree assortativity affect cooperation, and we know that cooperation is favoured if the benefit of the altruistic act divided
by the cost exceeds the average number of neighbours. However, a simple rule that would predict cooperation transitions on an arbitrary network has not yet been presented. Here we show that the unique sequence of degrees in a network can be used to predict at which game parameters major shifts in the level of cooperation can be expected, including phase transitions from absorbing to mixed strategy phases. We use the evolutionary prisoners dilemma game on random and scale-free networks to demonstrate the prediction, as well as its limitations and possible pitfalls. We observe good agreements between the predictions and the results obtained with concurrent and Monte Carlo methods for the update of the strategies, thus providing a simple and fast way to estimate the outcome of evolutionary social dilemmas on arbitrary networks without the need of actually playing the game.
We study the evolution of cooperation in spatial Prisoners dilemma games with and without extortion by adopting aspiration-driven strategy updating rule. We focus explicitly on how the strategy updating manner (whether synchronous or asynchronous) an
d also the introduction of extortion strategy affect the collective outcome of the games. By means of Monte Carlo (MC) simulations as well as dynamical cluster techniques, we find that the involvement of extortioners facilitates the boom of cooperators in the population (and whom can always dominate the population if the temptation to defect is not too large) for both synchronous and asynchronous strategy updating, in stark contrast to the otherwise case, where cooperation is promoted for intermediate aspiration level with synchronous strategy updating, but is remarkably inhibited if the strategy updating is implemented asynchronously. We explain the results by configurational analysis and find that the presence of extortion leads to the checkerboard-like ordering of cooperators and extortioners, which enable cooperators to prevail in the population with both strategy updating manners. Moreover, extortion itself is evolutionary stable, and therefore acts as the incubator for the evolution of cooperation.
A network effect is introduced taking into account competition, cooperation and mixed-type interaction amongst agents along a generalized Verhulst-Lotka-Volterra model. It is also argued that the presence of a market capacity enforces an indubious li
mit on the agents size growth. The state stability of triadic agents, i.e., the most basic network plaquette, is investigated analytically for possible scenarios, through a fixed point analysis. It is discovered that: (i) market demand is only satisfied for full competition when one agent monopolizes the market; (ii) growth of agent size is encouraged in full cooperation; (iii) collaboration amongst agents to compete against one single agent may result in the disappearance of this single agent out of the market, and (iv) cooperating with two rivals may become a growth strategy for an intelligent agent.
Melamed, Harrell, and Simpson have recently reported on an experiment which appears to show that cooperation can arise in a dynamic network without reputational knowledge, i.e., purely via dynamics [1]. We believe that their experimental design is ac
tually not testing this, in so far as players do know the last action of their current partners before making a choice on their own next action and subsequently deciding which link to cut. Had the authors given no information at all, the result would be a decline in cooperation as shown in [2].
Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a fr
amework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a Prisoners Dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
