网络拓扑
困境
极限(数学)
计算机科学
囚徒困境
拓扑(电路)
微观经济学
经济
数学
计算机网络
数学分析
几何学
组合数学
作者
Simone Righi,Károly Takács
标识
DOI:10.1142/s0219525914500118
摘要
The evolution of unconditional cooperation is one of the fundamental problems in science. A new solution is proposed to solve this puzzle. We treat this issue with an evolutionary model in which agents play the Prisoner's Dilemma on signed networks. The topology is allowed to co-evolve with relational signs as well as with agent strategies. We introduce a strategy that is conditional on the emotional content embedded in network signs. We show that this strategy acts as a catalyst and creates favorable conditions for the spread of unconditional cooperation. In line with the literature, we found evidence that the evolution of cooperation most likely occurs in networks with relatively high chances of rewiring and with low likelihood of strategy adoption. While a low likelihood of rewiring enhances cooperation, a very high likelihood seems to limit its diffusion. Furthermore, unlike in nonsigned networks, cooperation becomes more prevalent in denser topologies.
科研通智能强力驱动
Strongly Powered by AbleSci AI