树上赢-留-输合作的缓慢出现
Slow Emergence of Cooperation for Win-Stay Lose-Shift on Trees
摘要:
我们考虑图上的一组代理人,他们反复与他们的邻居玩囚徒困境游戏。玩家通过运用赢-留-输-转移策略来调整自己的行动以适应对手过去的行为。在有限连通图上,很容易看出系统通过在有限时间内收敛到全合作状态来学习合作。我们分析的收敛速率的大小和结构的图形。[Dyer例如,2002]表明系统在圈上快速收敛,但在图的大小上需要时间指数才能收敛到完全图上的合作。我们发现,合作的出现是指数缓慢的一些扩展图。更令人惊讶的是,我们发现它在有界度树中也是指数级缓慢的,而许多其他动力学都是快速收敛的。
英文摘要:
We consider a group of agents on a graph who repeatedly play the prisoner's dilemma game against their neighbors. The players adapt their actions to the past behavior of their opponents by applying the win-stay lose-shift strategy. On a finite connected graph, it is easy to see that the system learns to cooperate by converging to the all-cooperate state in a finite time. We analyze the rate of convergence in terms of the size and structure of the graph. [Dyer et al., 2002] showed that the system converges rapidly on the cycle, but that it takes a time exponential in the size of the graph to converge to cooperation on the complete graph. We show that the emergence of cooperation is exponentially slow in some expander graphs. More surprisingly, we show that it is also exponentially slow in bounded-degree trees, where many other dynamics are known to converge rapidly.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。