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

Dmitrii Lozovanu^a, Stefan Pickl<sup>b

a</sup> Institute of Mathematics and Computer Science of Moldova Academy of Sciences, Academiei 5, Chisinau, MD-2028, Moldova
^b Institute for Theoretical Computer Science, Mathematics and Operations Research, Universität der Bundeswehr München, 85577 Neubiberg-München, Germany

Abstract: 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.

Keywords: mean payoff game, pure stationary strategy, mixed stationary strategy, Nash equilibria.

Language: English