Many researches in game theory have been devoted to study the symmetric contest between the contestants. This is due to the computational advantage in this type of game. In contrast, asymmetric games are more complicated in mathematical computations than the symmetric one. This article is particularly interested in the model of asymmetric games. In this model, we cannot interchange the identities of the players without interchanging the payoff of the strategies. This model differs from the symmetric model, where each player has two different choices from the two choices of the other one. We consider that the round of the game is infinitely repeated (infinitely repeated and asymmetric 2×2 game). The payoff matrix corresponding to all possible strategies of the game is obtained. Furthermore, we will apply the resulting matrix in two examples. During this, we will draw the attention towards the behavior of some of the strategies and the evolutionary stability.
