Bibliography

This is a collection of various bibliographic items referenced in the documentation.

[Adami2013]

Adami C and Hintze A. (2013) Evolutionary instability of zero-determinant strategies demonstrates that winning is not everything. Nature communications. https://www.nature.com/articles/ncomms3193

[Akin2015]

Akin, Ethan. “What you gotta know to play good in the Iterated Prisoner’s Dilemma.” Games 6.3 (2015): 175-190.

[Amaral2016]

Amaral, M. A., Wardil, L., Perc, M., & Da Silva, J. K. L. (2016). Stochastic win-stay-lose-shift strategy with dynamic aspirations in evolutionary social dilemmas. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 94(3), 1–9. https://doi.org/10.1103/PhysRevE.94.032317

[Andre2013]

Andre L. C., Honovan P., Felipe T. and Frederico G. (2013). Iterated Prisoner’s Dilemma - An extended analysis, http://abricom.org.br/wp-content/uploads/2016/03/bricsccicbic2013_submission_202.pdf

[Ashlock2006]

Ashlock, D., & Kim E. Y, & Leahy, N. (2006). Understanding Representational Sensitivity in the Iterated Prisoner’s Dilemma with Fingerprints. IEEE Transactions On Systems, Man, And Cybernetics, Part C: Applications And Reviews, 36 (4)

[Ashlock2006b]

Ashlock, W. & Ashlock, D. (2006). Changes in Prisoner’s Dilemma Strategies Over Evolutionary Time With Different Population Sizes 2006 IEEE International Conference on Evolutionary Computation. http://DOI.org/10.1109/CEC.2006.1688322

[Ashlock2008]

Ashlock, D., & Kim, E. Y. (2008). Fingerprinting: Visualization and automatic analysis of prisoner’s dilemma strategies. IEEE Transactions on Evolutionary Computation, 12(5), 647–659. http://doi.org/10.1109/TEVC.2008.920675

[Ashlock2009]

Ashlock, D., Kim, E. Y., & Ashlock, W. (2009) Fingerprint analysis of the noisy prisoner’s dilemma using a finite-state representation. IEEE Transactions on Computational Intelligence and AI in Games. 1(2), 154-167 http://doi.org/10.1109/TCIAIG.2009.2018704

[Ashlock2014]

Ashlock, W., Tsang, J. & Ashlock, D. (2014) The evolution of exploitation. 2014 IEEE Symposium on Foundations of Computational Intelligence (FOCI) http://DOI.org/10.1109/FOCI.2014.7007818

[Ashlock2015]

Ashlock, D., Brown, J.A., & Hingston P. (2015). Multiple Opponent Optimization of Prisoner’s Dilemma Playing Agents. Multiple Opponent Optimization of Prisoner’s Dilemma Playing Agents http://DOI.org/10.1109/TCIAIG.2014.2326012

[Au2006]

Au, T.-C. and Nau, D. S. (2006) Accident or intention: That is the question (in the iterated prisoner’s dilemma). In Proc. Int. Conf. Auton. Agents and Multiagent Syst. (AAMAS), pp. 561–568. http://www.cs.umd.edu/~nau/papers/au2006accident.pdf

[Axelrod1980]

Axelrod, R. (1980). Effective Choice in the Prisoner’s Dilemma. Journal of Conflict Resolution, 24(1), 3–25.

[Axelrod1980b]

Axelrod, R. (1980). More Effective Choice in the Prisoner’s Dilemma. Journal of Conflict Resolution, 24(3), 379-403.

[Axelrod1984]

The Evolution of Cooperation. Basic Books. ISBN 0-465-02121-2.

[Axelrod1995]

Wu, J. and Axelrod, R. (1995). How to cope with noise in the Iterated prisoner’s dilemma, Journal of Conflict Resolution, 39(1), pp. 183–189. doi: 10.1177/0022002795039001008.

[Banks1990]

Banks, J. S., & Sundaram, R. K. (1990). Repeated games, finite automata, and complexity. Games and Economic Behavior, 2(2), 97–117. http://doi.org/10.1016/0899-8256(90)90024-O

[Bendor1993]

Bendor, Jonathan. “Uncertainty and the Evolution of Cooperation.” The Journal of Conflict Resolution, 37(4), 709–734.

[Beaufils1997]

Beaufils, B. & Delahaye, J. & Mathieu, P. (1997). Our Meeting With Gradual: A Good Strategy For The Iterated Prisoner’s Dilemma. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.4041

[Berg2015]

Berg, P. Van Den, & Weissing, F. J. (2015). The importance of mechanisms for the evolution of cooperation. Proceedings of the Royal Society B-Biological Sciences, 282.

[CRISTAL-SMAC2018]

CRISTAL Lab, SMAC Team, Lille University (2018). IPD : the Iterated Prisoner’s Dilemma. https://github.com/cristal-smac/ipd

[Downing1975]

Downing, Leslie L. “The Prisoner’s Dilemma game as a problem-solving phenomenon: An outcome maximization interpretation.” Simulation & Games 6.4 (1975): 366-391.

[Eckhart2015]

Eckhart Arnold (2016) CoopSim v0.9.9 beta 6. https://github.com/jecki/CoopSim/

[Frean1994]

Frean, Marcus R. “The Prisoner’s Dilemma without Synchrony.” Proceedings: Biological Sciences, vol. 257, no. 1348, 1994, pp. 75–79. www.jstor.org/stable/50253.

[Harper2017]

Harper, M., Knight, V., Jones, M., Koutsovoulos, G., Glynatsi, N. E., & Campbell, O. (2017) Reinforcement learning produces dominant strategies for the Iterated Prisoner’s Dilemma. PloS one. https://doi.org/10.1371/journal.pone.0188046

[Hauert2002]

Hauert, Christoph, and Olaf Stenull. “Simple adaptive strategy wins the prisoner’s dilemma.” Journal of Theoretical Biology 218.3 (2002): 261-272.

[Hilbe2013]

Hilbe, C., Nowak, M.A. and Traulsen, A. (2013). Adaptive dynamics of extortion and compliance, PLoS ONE, 8(11), p. e77886. doi: 10.1371/journal.pone.0077886.

[Hilbe2017]

Hilbe, C., Martinez-Vaquero, L. A., Chatterjee K., Nowak M. A. (2017). Memory-n strategies of direct reciprocity, Proceedings of the National Academy of Sciences May 2017, 114 (18) 4715-4720; doi: 10.1073/pnas.1621239114.

[Kuhn2017]

Kuhn, Steven, “Prisoner’s Dilemma”, The Stanford Encyclopedia of Philosophy (Spring 2017 Edition), Edward N. Zalta (ed.), https://plato.stanford.edu/archives/spr2017/entries/prisoner-dilemma/

[Kraines1989]

Kraines, David, and Vivian Kraines. “Pavlov and the prisoner’s dilemma.” Theory and decision 26.1 (1989): 47-79. doi:10.1007/BF00134056

[LessWrong2011]

Zoo of Strategies (2011) LessWrong. Available at: http://lesswrong.com/lw/7f2/prisoners_dilemma_tournament_results/

[Li2007]

Li, J, How to Design a Strategy to Win an IPD Tournament, in Kendall G., Yao X. and Chong S. (eds.) The iterated prisoner’s dilemma: 20 years on. World Scientific, chapter 4, pp. 29-40, 2007.

[Li2009]

Li, J. & Kendall, G. (2009). A Strategy with Novel Evolutionary Features for the Iterated Prisoner’s Dilemma. Evolutionary Computation 17(2): 257–274.

[Li2011]

Li, J., Hingston, P., Member, S., & Kendall, G. (2011). Engineering Design of Strategies for Winning Iterated Prisoner ’ s Dilemma Competitions, 3(4), 348–360.

[Li2014]

Li, J. and Kendall, G. (2014). The Effect of Memory Size on the Evolutionary Stability of Strategies in Iterated Prisoner’s Dilemma. IEEE Transactions on Evolutionary Computation, 18(6) 819-826

[LiS2014]

Li, Siwei. (2014). Strategies in the Stochastic Iterated Prisoner’s Dilemma. Available at: http://math.uchicago.edu/~may/REU2014/REUPapers/Li,Siwei.pdf

[Luis2008]

Luis R. Izquierdo and Segismundo S. Izquierdo (2008). Dynamics of the Bush-Mosteller Learning Algorithm in 2x2 Games, Reinforcement Learning, Cornelius Weber, Mark Elshaw and Norbert Michael Mayer (Ed.), InTech, DOI: 10.5772/5282. Available from: https://www.intechopen.com/books/reinforcement_learning/dynamics_of_the_bush-mosteller_learning_algorithm_in_2x2_games

[Mathieu2015]

Mathieu, P. and Delahaye, J. (2015). New Winning Strategies for the Iterated Prisoner’s Dilemma. Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems.

[Mittal2009]

Mittal, S., & Deb, K. (2009). Optimal strategies of the iterated prisoner’s dilemma problem for multiple conflicting objectives. IEEE Transactions on Evolutionary Computation, 13(3), 554–565. https://doi.org/10.1109/TEVC.2008.2009459

[Nachbar1992]

Nachbar J., Evolution in the finitely repeated prisoner’s dilemma, Journal of Economic Behavior & Organization, 19(3): 307-326, 1992.

[NC2019]

https://github.com/ncase/trust (Accessed: 30 October 2019)

[Nowak1989]

Nowak, Martin, and Karl Sigmund. “Game-dynamical aspects of the prisoner’s dilemma.” Applied Mathematics and Computation 30.3 (1989): 191-213.

[Nowak1990]

Nowak, M., & Sigmund, K. (1990). The evolution of stochastic strategies in the Prisoner’s Dilemma. Acta Applicandae Mathematica. https://link.springer.com/article/10.1007/BF00049570

[Nowak1992]

Nowak, M.., & May, R. M. (1992). Evolutionary games and spatial chaos. Nature. http://doi.org/10.1038/359826a0

[Nowak1993]

Nowak, M., & Sigmund, K. (1993). A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner’s Dilemma game. Nature, 364(6432), 56–58. http://doi.org/10.1038/364056a0

[Ohtsuki2006]

Ohtsuki, Hisashi, et al. “A simple rule for the evolution of cooperation on graphs and social networks.” Nature 441.7092 (2006): 502.

[PD2017]

http://www.prisoners-dilemma.com/competition.html (Accessed: 6 June 2017)

[Press2012]

Press, W. H., & Dyson, F. J. (2012). Iterated Prisoner’s Dilemma contains strategies that dominate any evolutionary opponent. Proceedings of the National Academy of Sciences, 109(26), 10409–10413. http://doi.org/10.1073/pnas.1206569109

[Prison1998]

LIFL (1998) PRISON. Available at: http://www.lifl.fr/IPD/ipd.frame.html (Accessed: 19 September 2016).

[Robson1990]

Robson, Arthur J. “Efficiency in evolutionary games: Darwin, Nash and the secret handshake.” Journal of theoretical Biology 144.3 (1990): 379-396.

[Roemheld2013]

Roemheld, Lars. “Evolutionary Extortion and Mischief: Zero Determinant strategies in iterated 2x2 games”. Available at: https://arxiv.org/abs/1308.2576

[Singer-Clark2014]

Singer-Clark, T. (2014). Morality Metrics On Iterated Prisoner’s Dilemma Players.

[Shakarian2013]

Shakarian, P., Roos, P. & Moores, G. A Novel Analytical Method for Evolutionary Graph Theory Problems.

[Slany2007]

Slany W. and Kienreich W., On some winning strategies for the iterated prisoner’s dilemma, in Kendall G., Yao X. and Chong S. (eds.) The iterated prisoner’s dilemma: 20 years on. World Scientific, chapter 8, pp. 171-204, 2007.

[Stewart2012]

Stewart, a. J., & Plotkin, J. B. (2012). Extortion and cooperation in the Prisoner’s Dilemma. Proceedings of the National Academy of Sciences, 109(26), 10134–10135. http://doi.org/10.1073/pnas.1208087109

[Szabo2007]

Szabó, G., & Fáth, G. (2007). Evolutionary games on graphs. Physics Reports, 446(4-6), 97–216. http://doi.org/10.1016/j.physrep.2007.04.004

[Gaudesi2016]

Gaudesi, Marco, et al. “Exploiting evolutionary modeling to prevail in iterated prisoner’s dilemma tournaments.” IEEE Transactions on Computational Intelligence and AI in Games 8.3 (2016): 288-300.

[Tzafestas2000]

Tzafestas, E. (2000). Toward adaptive cooperative behavior. From Animals to Animals: Proceedings of the 6th International Conference on the Simulation of Adaptive Behavior {(SAB-2000)}, 2, 334–340.