A new equilibrium in cyclic games on graphs

We prove that there exists an equilibrium for stationary strategies in cyclic games where the game on vertices of a graph lasts until it reaches a cycle, and the payment of one player to the other equals the sum of the maximal and minimal costs of the edges of this cycle.