Repeated prisoner's dilemma: stackelberg solution with finite memory

摘要

A hierarchical statement of the infinitely repeated Prisoner's Dilemma with finite memory of the players is considered. An algorithm of constructing the optimal strategies is develoed. It is shown that the profits of both the leader and the follower are greater than ones, obtained in the case of mutual defection of the players. For memory length one and two steps the optimal strategy of the leader, depending on the game parameters, has been constructed.