اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPromote cooperation by localised small-world communication
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The emergence and maintenance of cooperation within sizable groups of unrelated humans offer many challenges for our understanding. We propose that the humans capacity of communication, such as how many and how far away the fellows can build up mutual communications, may affect the evolution of cooperation. We study this issue by means of the public goods game (PGG) with a two-layered network of contacts. Players obtain payoffs from five-person public goods interactions on a square lattice (the interaction layer). Also, they update strategies after communicating with neighbours in learning layer, where two players build up mutual communication with a power law probability depending on their spatial distance. Our simulation results indicate that the evolution of cooperation is indeed sensitive to how players choose others to communicate with, including the amount as well as the locations. The tendency of localised communication is proved to be a new mechanism to promote cooperation.
قيم البحث
اقرأ أيضاً
We propose a dynamical model in which a network structure evolves in a self-organized critical (SOC) manner and explain a possible origin of the emergence of fractal and small-world networks. Our model combines a network growth and its decay by failu
res of nodes. The decay mechanism reflects the instability of large functional networks against cascading overload failures. It is demonstrated that the dynamical system surely exhibits SOC characteristics, such as power-law forms of the avalanche size distribution, the cluster size distribution, and the distribution of the time interval between intermittent avalanches. During the network evolution, fractal networks are spontaneously generated when networks experience critical cascades of failures that lead to a percolation transition. In contrast, networks far from criticality have small-world structures. We also observe the crossover behavior from fractal to small-world structure in the network evolution.
In the compromise model of continuous opinions proposed by Deffuant et al, the states of two agents in a network can start to converge if they are neighbors and if their opinions are sufficiently close to each other, below a given threshold of tolera
nce $epsilon$. In directed networks, if agent i is a neighbor of agent j, j need not be a neighbor of i. In Watts-Strogatz networks we performed simulations to find the averaged number of final opinions $<F>$ and their distribution as a function of $epsilon$ and of the network structural disorder. In directed networks $<F>$ exhibits a rich structure, being larger than in undirected networks for higher values of $epsilon$, and smaller for lower values of $epsilon$.
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the networks follo
w a power-law degree distribution, with degree exponent continuously tuned between 2 and 3. The exact expression of clustering coefficient is also provided for the networks. Furthermore, the investigation of the average path length reveals that the networks possess small-world feature. Interestingly, we find that a special case of our model can be mapped into the Yule process.
The emergence and promotion of cooperation are two of the main issues in evolutionary game theory, as cooperation is amenable to exploitation by defectors, which take advantage of cooperative individuals at no cost, dooming them to extinction. It has
been recently shown that the existence of purely destructive agents (termed jokers) acting on the common enterprises (public goods games) can induce stable limit cycles among cooperation, defection, and destruction when infinite populations are considered. These cycles allow for time lapses in which cooperators represent a relevant fraction of the population, providing a mechanism for the emergence of cooperative states in nature and human societies. Here we study analytically and through agent-based simulations the dynamics generated by jokers in finite populations for several selection rules. Cycles appear in all cases studied, thus showing that the joker dynamics generically yields a robust cyclic behavior not restricted to infinite populations. We also compute the average time in which the population consists mostly of just one strategy and compare the results with numerical simulations.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
