Coevolution of quantum and classical strategies on evolving random networksQiang Li
, Azhar Iqbal
, Matjaž Perc
, Minyou Chen
, Derek Abbott
, 2013, original scientific article
Abstract: We study the coevolution of quantum and classical strategies on weighted and directed random networks in the realm of the prisoners dilemma game. During the evolution, agents can break and rewire their links with the aim of maximizing payoffs, and they can also adjust the weights to indicate preferences, either positive or negative, towards their neighbors. The network structure itself is thus also subject to evolution. Importantly, the directionality of links does not affect the accumulation of payoffs nor the strategy transfers, but serves only to designate the owner of each particular link and with it the right to adjust the link as needed. We show that quantum strategies outperform classical strategies, and that the critical temptation to defect at which cooperative behavior can be maintained rises, if the network structure is updated frequently. Punishing neighbors by reducing the weights of their links also plays an important role in maintaining cooperation under adverse conditions. We find that the self-organization of the initially random network structure, driven by the evolutionary competition between quantum and classical strategies, leads to the spontaneous emergence of small average path length and a large clustering coefficient.
Keywords: evolutionary games, quantum strategies, coevolution, random networks, cooperation
Published: 19.06.2017; Views: 340; Downloads: 185
Full text (803,96 KB)
This document has many files! More...