Evolution of Iterated Prisoner's Dilemma Strategies with Different History Lengths in Static and Cultural Environments

被引:0
|
作者
Brunauer, Richard [1 ]
Loecker, Andreas [1 ]
Mayer, Helmut A. [1 ]
Mitterlechner, Gerhard [1 ]
Payer, Hannes [1 ]
机构
[1] Salzburg Univ, Dept Comp Sci, A-5020 Salzburg, Austria
关键词
Iterated Prisoner's Dilemma; Evolutionary Computation; Cultural Algorithms;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We investigate evolutionary approaches to generate well-performing strategies for the iterated prisoner's dilemma (IPD) with different history lengths in static and cultural environments. The length of the history determines the number of the most recent moves of both players taken into account for the current move decision. The static environment constituting the opponents of the evolved players is made up of ten standard strategies known from the literature. The cultural environment starts with the standard strategies and gradually increases by addition of the best evolved players representing a culture. The performance of the various evolved strategies is compared in specific tournaments. Also, the behavior of an evolved player is analyzed in more detail by looking at the specific game sequences (and corresponding decisions), which out of all possible sequences are actually utilized in a tournament.
引用
收藏
页码:720 / 727
页数:8
相关论文
共 50 条
  • [1] Evolution of Cooperative Strategies for Iterated Prisoner's Dilemma on Networks
    Ishibuchi, Hisao
    Sudo, Takahiko
    Hoshino, Koichiro
    Nojima, Yusuke
    [J]. 2013 FIFTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL ASPECTS OF SOCIAL NETWORKS (CASON), 2013, : 32 - 37
  • [2] Adapation of Iterated Prisoner's Dilemma strategies by evolution and learning
    Quek, Han Yang
    Goh, Chi Keong
    [J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND GAMES, 2007, : 40 - 47
  • [3] Evolution of Strategies With Different Representation Schemes in a Spatial Iterated Prisoner's Dilemma Game
    Ishibuchi, Hisao
    Ohyanagi, Hiroyuki
    Nojima, Yusuke
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2011, 3 (01) : 67 - 82
  • [4] Evolving strategies for agents in the iterated prisoner's dilemma in noisy environments
    O'Riordan, C
    [J]. ADAPTIVE AGENTS AND MULTI-AGENT SYSTEMS II: ADAPTATION AND MULTI-AGENT LEARNING, 2005, 3394 : 205 - 215
  • [5] Critical Dynamics in the Evolution of Stochastic Strategies for the Iterated Prisoner's Dilemma
    Iliopoulos, Dimitris
    Hintze, Arend
    Adami, Christoph
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2010, 6 (10)
  • [6] A Differential Evolution Algorithm to Develop Strategies for the Iterated Prisoner's Dilemma
    Rigakis, Manousos
    Trachanatzi, Dimitra
    Marinaki, Magdalene
    Marinakis, Yannis
    [J]. MACHINE LEARNING, OPTIMIZATION, AND BIG DATA, MOD 2017, 2018, 10710 : 133 - 145
  • [7] Stationary strategies in iterated prisoner's dilemma
    Levchenkov V.S.
    Levchenkova L.G.
    [J]. Computational Mathematics and Modeling, 2006, 17 (3) : 254 - 273
  • [8] Shopkeeper Strategies in the Iterated Prisoner's Dilemma
    Ashlock, Daniel
    Kuusela, Christopher
    Cojocaru, Monica
    [J]. 2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 1063 - 1070
  • [9] Invincible Strategies of Iterated Prisoner's Dilemma
    Wang, Shiheng
    Lin, Fangzhen
    [J]. AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2019, : 2256 - 2258
  • [10] PREFERENCE AND EVOLUTION IN THE ITERATED PRISONER’S DILEMMA
    王先甲
    刘伟兵
    [J]. Acta Mathematica Scientia, 2009, (02) : 456 - 464