Network reciprocity on spatial prisoner's dilemma games by Continuous-binary strategy

Noriyuki Kishimoto, Satoshi Kokubo, Jun Tanimoto

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

For 2 × 2 games, especially the Spatial Prisoner's Dilemma (SPD), most of the previous studies presumed that players can offer either cooperation (C) or defection (D), the so-called discrete strategy. In this paper, we define Continuous-binary strategy instead of discrete strategy. And a systematic series of numerical simulations reports that it enhances the network reciprocity for SPD. This new strategy is based on our previous finding that continuous and mixed strategy are robust in boundary games of Chicken and PD (BCH), and Stag Hunt and PD (BSH), respectively. The new strategy allows to put both advantages of continuous and mixed strategies on usual discrete strategy together in one model.

本文言語英語
ホスト出版物のタイトル6th International Conference on Soft Computing and Intelligent Systems, and 13th International Symposium on Advanced Intelligence Systems, SCIS/ISIS 2012
ページ663-668
ページ数6
DOI
出版ステータス出版済み - 2012
イベント2012 Joint 6th International Conference on Soft Computing and Intelligent Systems, SCIS 2012 and 13th International Symposium on Advanced Intelligence Systems, ISIS 2012 - Kobe, 日本
継続期間: 11 20 201211 24 2012

出版物シリーズ

名前6th International Conference on Soft Computing and Intelligent Systems, and 13th International Symposium on Advanced Intelligence Systems, SCIS/ISIS 2012

その他

その他2012 Joint 6th International Conference on Soft Computing and Intelligent Systems, SCIS 2012 and 13th International Symposium on Advanced Intelligence Systems, ISIS 2012
Country日本
CityKobe
Period11/20/1211/24/12

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software

フィンガープリント 「Network reciprocity on spatial prisoner's dilemma games by Continuous-binary strategy」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル