Multiple Trial Two Strategy Conflicts

Much work has been done on iterated conflicts where the one-trial conflict is the Prisonerʹs Dilemma. The present paper is concerned with an iterated contest where the underlying contest has two pure strategies and the underlying payoff matrix is general; this therefore includes the Prisonerʹs Dilemma as a special case. By limiting the playerʹs memory severely we can almost completely specify the Evolutionary Stable Strategies (ESS) of the two- and infinite-trial conflicts derived from this underlying payoff matrix.