Anatole Rapaport used a four-line algorithm to analyze this setup after Robert Axelrod organized a tournament where people designed algorithms for this setup, determining that its iterated type is usually best solved by tit-for-tat.
Anatole Rapaport used a four-line algorithm to analyze this setup after Robert Axelrod organized a tournament where people designed algorithms for this setup, determining that its iterated type is usually best solved by tit-for-tat. Human players in this setup usually use the formally irrational strategy likely because reputation factors into the iterated version. Its Pareto-optimal outcome is "both cooperate". For 10 points, the Nash equilibrium involves both namesake people defecting to the police in what super-basic game theory game involving two convicts?
Anatole Rapaport used a four-line algorithm to analyze this setup after Robert Axelrod organized a tournament where people designed algorithms for this setup, determining that its iterated type is usually best solved by tit-for-tat.
iterated prisoner's dilemma