By analyzing fixation processes under \(2\times 2\)  games, [1]} concluded that anti-coordination games have average conditional fixation times that grow exponentially with population size for asymptotically large populations. The base of exponential growth \(\tau \)  can be calculated from the payoff matrix. The average conditional fixation time thus becomes
\(t_N\sim \tau (a,b,c,d)^N,\) 
