Strategies for the Iterated Prisoner's Dilemma
Computer Science and Game Theory
2021-11-30 v2
Abstract
We explore some strategies which tend to perform well in the IPD. We start off by showing the significance of Tit-For-Tat strategies in evolutionary game theory. This is followed by a theoretical derivation of zero-determinant strategies, where we highlight an error on bounds for scale parameters from the original paper on ZD strategies[6]. We then present examples of such strategies and create a custom player drawing inspiration from Markov Decision Processes. At the end we pit them all against each other and see how they perform in an IPD tournament.
Keywords
Cite
@article{arxiv.2111.11561,
title = {Strategies for the Iterated Prisoner's Dilemma},
author = {Anagh Malik},
journal= {arXiv preprint arXiv:2111.11561},
year = {2021}
}