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
来源
APPLIED COMPUTING 2007, VOL 1 AND 2 | 2007年
关键词
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 Strategies With Different Representation Schemes in a Spatial Iterated Prisoner's Dilemma Game
    Ishibuchi, Hisao
    Ohyanagi, Hiroyuki
    Nojima, Yusuke
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2011, 3 (01) : 67 - 82
  • [2] Adapation of Iterated Prisoner's Dilemma strategies by evolution and learning
    Quek, Han Yang
    Goh, Chi Keong
    2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND GAMES, 2007, : 40 - 47
  • [3] The Competitions of Forgiving Strategies in the Iterated Prisoner's Dilemma
    Binmad, Ruchdee
    Li, Mingchu
    Deonauth, Nakema
    Hungsapruek, Theerawat
    Limwudhikraijirath, Aree
    2018 IEEE INTERNATIONAL CONFERENCE ON AGENTS (ICA), 2018, : 39 - 43
  • [4] New Winning Strategies for the Iterated Prisoner's Dilemma
    Mathieu, Philippe
    Delahaye, Jean-Paul
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1665 - 1666
  • [5] Evolutionary Successful Strategies in a Transparent iterated Prisoner's Dilemma
    Unakafov, Anton M.
    Schultze, Thomas
    Kagan, Igor
    Moeller, Sebastian
    Gail, Alexander
    Treue, Stefan
    Eule, Stephan
    Wolf, Fred
    APPLICATIONS OF EVOLUTIONARY COMPUTATION, EVOAPPLICATIONS 2019, 2019, 11454 : 204 - 219
  • [6] The evolution of punishment and apology: an iterated prisoner's dilemma model
    Okamoto, K
    Matsumura, S
    EVOLUTIONARY ECOLOGY, 2000, 14 (08) : 703 - 720
  • [7] The evolution of punishment and apology: an iterated prisoner's dilemma model
    Kyoko Okamoto
    Shuichi Matsumura
    Evolutionary Ecology, 2000, 14 : 703 - 720
  • [8] SMALE STRATEGIES FOR THE n-PERSON ITERATED PRISONER'S DILEMMA
    Akin, Ethan
    Plaskacz, Slawomir
    Zwierzchowska, Joanna
    TOPOLOGICAL METHODS IN NONLINEAR ANALYSIS, 2019, 53 (01) : 351 - 361
  • [9] Evolving novelty strategies for the Iterated Prisoner's Dilemma in deceptive tournaments
    Noordman, C. R.
    Vreeswijk, G. A. W.
    THEORETICAL COMPUTER SCIENCE, 2019, 785 : 1 - 16
  • [10] Probabilistic memory-one strategies for the iterated prisoner's dilemma
    Delahaye J.-P.
    Mathieu P.
    2018, Lavoisier (32) : 141 - 167