Focusing on the games under which fixation probabilities are decreasing functions of \(N\) , these might have either a zero or finite asymptotic limit, depending on the values in the payoff matrix. According to [1]}, dominance games have a mutant strategy holding a finite asymptotic value if \(a>c\)  and \(b>d\) , otherwise this value is zero. Looking at the entries in table  corresponding to these games, we may conclude that the first game ordering for every pair (i.e. the dominating strategy) always holds a finite asymptotic value (DF when decreasing), while the second (i.e. the dominated strategy) always holds a null asymptotic value (D0 when decreasing).
