Iterated symmetric three-player prisoner’s dilemma game

Although, most game theory researches on the prisoner’s dilemma have centered on two-player models, it is possible to create it to be consisted of three or even more players. In this paper, we are interested in the model of three-player iterated prisoner’s dilemma game where, each player has two choices. The action of each strategy in this model depends on the previous action of the last round. Each strategy is presented by finite state of automata. We used a computer program to calculate the payoff values resulting from the actions of all possible strategies. We study the behavior of four different strategies related to Tit for Tat concept. The conditions of each strategy to be the best are determined. In Appendix section, we design an algorithm and implement it using the Java programing language to facilitate the calculations.