论文标题
网络题为囚犯的困境
Network-Iterated Prisoner's Dilemma
论文作者
论文摘要
我们介绍了随机网络识别的囚犯困境（NIPD）模型，这是一个与邻居一起玩囚犯困境的玩家网络，每个人都有一种记忆一项策略，他们不断地并在当地进行更新以改善他们的成功。这个过程是非确定性的，并且反映了许多相关方面的社会互动。我们使用它来评估一些知名策略的灵活性，噪声耐受性和现实的适应性。此外，在模型中，一种新的策略自然而然地出现了，这比那些策略更成功。我们还得出了一些理论参数，这些参数在这种情况下衡量了策略的成功。
We introduce the stochastic Network-Iterated Prisoner's Dilemma (NIPD) model, a network of players playing the Prisoner's Dilemma with their neighbours, each with a memory-one strategy which they constantly and locally update to improve their success. This process is non-deterministic, and mirrors societal interactions in many relevant aspects. We use it to assess the flexibility, noise tolerance and real-world adaptability of some well-known strategies. Furthermore, in the model a new strategy naturally emerges which proves way more successful than those. We also derive some theoretical parameters that gauge the success of a strategy in this context.
