Is there switching for replicator dynamics and bimatrix games?

We consider heteroclinic networks for replicator dynamics and bimatrix games, that is, in a simplex or product of simplices, with equilibria at the vertices and connections at the edges–edge networks. Switching dynamics near a heteroclinic network occurs whenever every (infinite) sequence of connections in the network is shadowed by at least one trajectory in its neighborhood. Aguiar and Castro [M.A.D. Aguiar, S.B.S.D. Castro Chaotic switching in a two-person game, Physica D 239 (16), 1598–1609] prove switching near an edge network for the dynamics of the rock–scissors–paper game. Here we give conditions for switching dynamics in general bimatrix games and show that switching near an edge network can never occur for replicator dynamics.