Nash equilibria in mixed stationary strategies for $m$-player mean payoff games on networks

We consider a class of non-zero-sum mean payoff games on networks that extends the two-player zero-sum mean payoff game introduced by Ehrenfeucht and Mycielski. We show that for the considered class of games there exist Nash equilibria in mixed stationary strategies and propose an approach for determining the optimal strategies of the players.