Resolution of the N-Person Prisoners’ Dilemma by Kalai's Preplay Negotiation Procedure

In this paper, we apply the preplay negotiation procedure proposed by Kalai (1981) to the n -person prisoners’ dilemma with n ≥ 3 and examine whether it generates cooperation. We show that if the preplay is carried out at least once, the preplay game has a perfect equilibrium point that realizes cooperation. We also show that if the preplay is excuted at least twice, the game has a perfect equilibrium point that realizes cooperation regardless of the entering action profile (the starting point of the preplays). Our results are a generalization of Kalai’s (1981) that were obtained for the two-person prisoners’ dilemma