اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCommunity structure benefits the fixation of cooperation under strong selection
152
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recent empirical studies suggest that heavy-tailed distributions of human activities are universal in real social dynamics [Muchnik, emph{et al.}, Sci. Rep. textbf{3}, 1783 (2013)]. On the other hand, community structure is ubiquitous in biological and social networks [M.~E.~J. Newman, Nat. Phys. textbf{8}, 25 (2012)]. Motivated by these facts, we here consider the evolutionary Prisoners dilemma game taking place on top of a real social network to investigate how the community structure and the heterogeneity in activity of individuals affect the evolution of cooperation. In particular, we account for a variation of the birth-death process (which can also be regarded as a proportional imitation rule from social point of view) for the strategy updating under both weak- and strong-selection (meaning the payoffs harvested from games contribute either slightly or heavily to the individuals performance). By implementing comparative studies, where the players are selected either randomly or in terms of their actual activities to playing games with their immediate neighbors, we figure out that heterogeneous activity benefits the emergence of collective cooperation in harsh environment (the action for cooperation is costly) under strong selection, while it impairs the formation of altruism under weak selection. Moreover, we find that the abundance of communities in the social network can evidently foster the fixation of cooperation under strong-selection, in contrast to the games evolving on the randomized counterparts. Our results are therefore helpful for us to better understand the evolution of cooperation in real social systems.
قيم البحث
اقرأ أيضاً
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.
We study the effect of localized attacks on a multiplex spatial network, where each layer is a network of communities. The system is considered functional when the nodes belong to the giant component in all the multiplex layers. The communities are o
f linear size $zeta$, such that within them any pair of nodes are linked with same probability, and additionally nodes in nearby communities are linked with a different (typically smaller) probability. This model can represent an interdependent infrastructure system of cities where within the city there are many links while between cities there are fewer links. We develop an analytical method, similar to the finite element method applied to a network with communities, and verify our analytical results by simulations. We find, both by simulation and theory, that for different parameters of connectivity and spatiality --- there is a critical localized size of damage above which it will spread and the entire system will collapse.
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.
Pro-social punishment is a key driver of harmonious and stable society. However, this institution is vulnerable to corruption since law-violators can avoid sanctioning by paying bribes to corrupt law-enforcers. Consequently, to understand how altruis
tic behavior survives in a corrupt environment is an open question. To reveal potential explanations here we introduce corrupt enforcers and violators into the public goods game with pool punishment, and assume that punishers, as corrupt enforcers, may select defectors probabilistically to take a bribe from, and meanwhile defectors, as corrupt violators, may select punishers stochastically to be corrupted. By means of mathematical analysis, we aim to study the necessary conditions for the evolution of cooperation in such corrupt environment. We find that cooperation can be maintained in the population in two distinct ways. First, cooperators, defectors, and punishers can coexist by all keeping a steady fraction of the population. Second, these three strategies can form a cyclic dominance that resembles a rock-scissors-paper cycle or a heteroclinic cycle. We theoretically identify conditions when the competing strategies coexist in a stationary way or they dominate each other in a cyclic way. These predictions are confirmed numerically.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
