Periodic strategies and rationalizability in perfect information 2-Player strategic form games

We define and study periodic strategies in two player finite strategic form games. This concept can arise from some epistemic analysis of the rationalizability concept of Bernheim and Pearce. We analyze in detail the pure strategies and mixed strategies cases. In the pure strategies case, we prove that every two player finite action game has at least one periodic strategy, making the periodic strategies an inherent characteristic of these games. Applying the algorithm of periodic strategies in the case where mixed strategies are used, we find some very interesting outcomes with useful quantitative features for some classes of games. Particularly interesting are the implications of the algorithm to collective action games, for which we were able to establish the result that the collective action strategy can be incorporated in a purely non-cooperative context. Moreover, we address the periodicity issue for the case the players have a continuum set of strategies available. We also discuss whether periodic strategies can imply any sort of cooperativity. In addition, we put the periodic strategies in an epistemic framework.