Invincible Strategies of Iterated Prisoner's Dilemma

被引：0

作者：

Wang, Shiheng ^{[1
]}

Lin, Fangzhen ^{[2
]}

机构：

[1] Hong Kong Univ Sci & Technol, Kowloon, Clear Water Bay, Hong Kong, Peoples R China

[2] Hong Kong Univ Sci & Technol, HKUST Xiaoi Robot Joint Lab, Hong Kong, Peoples R China

来源：

AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS | 2019年

关键词：

Evolution of cooperation; Repeated games; Memory-one strategies; Invincible strategies; EVOLUTION;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Iterated Prisoner's Dilemma (IPD) is a well-known benchmark for studying rational agents' long term behaviour such as how cooperation can emerge among selfish and unrelated agents that need to co-exist over long term. Many well-known strategies have been studied, from the simple tit-for-tat (TFT) made famous by Axelrod after his influential tournaments to more involved ones like zero determinant and extortionate strategies studied recently by Press and Dyson. In this paper, we consider what we call invincible strategies. These are ones that will never lose against any other strategy in terms of average payoff in the limit. We provide a simple characterization of this class of strategies, and discuss its relationship with some other classes of strategies.

引用

页码：2256 / 2258

页数：3

共 50 条

[11] 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
[12] 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
[13] Evolution of Cooperative Strategies for Iterated Prisoner's Dilemma on Networks
Ishibuchi, Hisao
Sudo, Takahiko
Hoshino, Koichiro
Nojima, Yusuke
2013 FIFTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL ASPECTS OF SOCIAL NETWORKS (CASON), 2013, : 32 - 37
[14] Asynchronous Iterated Prisoner's Dilemma
Newth, David
ADAPTIVE BEHAVIOR, 2009, 17 (02) : 175 - 183
[15] Engineering Design of Strategies for Winning Iterated Prisoner's Dilemma Competitions
Li, Jiawei
Hingston, Philip
Kendall, Graham
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2011, 3 (04) : 348 - 360
[16] Critical Dynamics in the Evolution of Stochastic Strategies for the Iterated Prisoner's Dilemma
Iliopoulos, Dimitris
Hintze, Arend
Adami, Christoph
PLOS COMPUTATIONAL BIOLOGY, 2010, 6 (10)
[17] Evolving strategies for agents in the iterated prisoner's dilemma in noisy environments
O'Riordan, C
ADAPTIVE AGENTS AND MULTI-AGENT SYSTEMS II: ADAPTATION AND MULTI-AGENT LEARNING, 2005, 3394 : 205 - 215
[18] Domination in Iterated Prisoner's Dilemma
Brown, Joseph Alexander
Ashlock, Daniel A.
2011 24TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2011, : 1125 - 1128
[19] A Differential Evolution Algorithm to Develop Strategies for the Iterated Prisoner's Dilemma
Rigakis, Manousos
Trachanatzi, Dimitra
Marinaki, Magdalene
Marinakis, Yannis
MACHINE LEARNING, OPTIMIZATION, AND BIG DATA, MOD 2017, 2018, 10710 : 133 - 145
[20] 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

← 1 2 3 4 5 →