Nash Equilibria in Mixed Stationary Strategies for  m-Player Mean Payoff Games on Networks

Dmitrii Lozovanu; Stefan  Pickl

Authors

Dmitrii Lozovanu Institute of Mathematics and Computer Science of Moldova Academy of Sciences, Academiei 5, Chisinau
Stefan Pickl Institute of Theoretical Computer Science, Mathematics and Operations Research, Universität der Bundeswehr München

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

Downloads

Download data is not yet available.

References

Alpern, S. (1991). Cycles in extencsive form perfect information games. Journal of Mathematical Analysis and Applications, 159, 1–17.

Dasgupta, P. and Maskin, E. (1986). The existence of an equilibrium in discontinuous economic games. The Review of Economic Studies, 53, 1–26.

Ehrenfeucht, A. and Mycielski, J. (1979). Positional strategies for mean payoff games. International Journal of Game Theory, 8, 109–113.

Gurvich, V., Karzanov, A. and Khachiyan, L. (1988). Cyclic games and an algorithm to find minimax cicle means in directed graphs. USSR Computational Mathematics and Mathematical Physics, 28, 85–91.

Lozovanu, D. (2018). Stationary Nash equilibria for average stochastic positional games. In: Petrosyan, L., Mazalov, V., Zenkevich, N. (eds) Static amd Dynamic Game Theory: Foundations and Applications, Springer (to appear).

Lozovanu, D. and Pickl, S. (2006). Nash equilibria conditions for cyclic games with m players. Electronic Notes in Discrete Mathematics, 28, 85–91.

Lozovanu, D. and Pickl, S. (2015). Optimization of Stochastic Discrete Systems and Control on Complex Networks. Springer.

Lozovanu, D. and Pickl, S. (2016). Determining the optimal strategies for zero-sum average stochastic positional games. Electronic Notes in Discrete Mathematics, 55, 155–159.

Zwick, U. and Paterson, M. (1996). The complexity of mean payoffs on graphs. Theoretical Computer Science, 158, 343–359.