Two population three-player prisoner’s dilemma game

• We present a two population three-player prisoner’s dilemma.
• Finite state automata are used.
• Different types of Tit for Tat strategies.
• All possible payoffs are computed.

Due to the computational advantage in symmetric games, most researches have focused on the symmetric games instead of the asymmetric ones which need more computations. In this paper, we present prisoner’s dilemma game involving three players, and suppose that two players among them agree against the third player by choosing either to cooperate together or to defect together at each round. According to that assumption, the game is transformed from the symmetric three- player model to asymmetric two-player model such that, the identities of the players cannot be interchanged without interchanging the payoff of the strategies. Each strategy in the resulting model is expressed with two state automata. We determine the payoff matrix corresponding to the all possible strategies. We noticed that, for some strategies, it is better to be a player of the first type (independent player) than being of the second type (allies).