Scholarlink

In this study, the Prisoner's Dilemma is implemented using a network. In the conventional model, the problem is that as the parameters increase, the number of Defectors increases, and Co-operators are eliminated. To solve this problem, we have introduced memory into our model. However, it is well known that Co-operators cannot be maintained simply by introducing memory unless a long past is considered, but it is not realistic to remember the long past accurately. Therefore, we were able to create a model that can maintain Co-operators even with short-term memory by introducing a rule to update to a strategy that has not been experienced much in the past. In particular, this model focuses on one past interaction of a player and adjacent players to consider the neighbour's influence.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Robustness of Short-Term Memory Models on Networks in Spatial Prisoner’s Dilemma

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Akihiro Takahara,
  • Tomoko Sakiyama

摘要

In this study, the Prisoner's Dilemma is implemented using a network. In the conventional model, the problem is that as the parameters increase, the number of Defectors increases, and Co-operators are eliminated. To solve this problem, we have introduced memory into our model. However, it is well known that Co-operators cannot be maintained simply by introducing memory unless a long past is considered, but it is not realistic to remember the long past accurately. Therefore, we were able to create a model that can maintain Co-operators even with short-term memory by introducing a rule to update to a strategy that has not been experienced much in the past. In particular, this model focuses on one past interaction of a player and adjacent players to consider the neighbour's influence.