Fault-tolerant strategies in the iterated prisoner's dilemma

DOI10.1016/J.IPL.2010.03.007zbMATH Open1229.91060OpenAlexW1995069085MaRDI QIDQ656583FDOQ656583

Andrzej Pelc

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.007

Recommendations

• What you gotta know to play good in the iterated prisoner's dilemma
• Types of evolutionary stability and the problem of cooperation.
• Tit-for-tat or win-stay, lose-shift?
• Stochastic strategies in the prisoner's dilemma
• Partners or rivals? Strategies for the iterated prisoner's dilemma

zbMATH Keywords

fault-toleranceprisoner's dilemmabounded memoryrobust strategy

Mathematics Subject Classification ID

Noncooperative games (91A10) Multistage and repeated games (91A20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite automata play the repeated prisoner's dilemma
• Evolutionary stability in repeated games played by finite automata

This page was built for publication: Fault-tolerant strategies in the iterated prisoner's dilemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656583)