TOPICS
Search

Mean-Payoff Game


A mean-payoff game is a two-player zero-sum game on a finite directed graph whose vertices are assigned to the players Max and Min and whose edges have numerical rewards. Each graph vertex has an outgoing graph edge, and its owner chooses the next graph edge. Both players observe the complete preceding play and may choose strategies that depend on this history.

For the infinite walk traversing edges e_0,e_1,..., the payoff to Max is

 liminf_(T->infty)1/Tsum_(t=0)^(T-1)w(e_t),

where w(e) is the reward of graph edge e and liminf denotes the infimum limit. Max seeks to maximize this payoff and Min seeks to minimize it. A positional strategy chooses an outgoing graph edge using only the current graph vertex.


See also

Game Theory, Mean-Payoff Parity Game, Quasipolynomial Time, Stochastic Mean-Payoff Game, Strategy, Zero-Sum Game

Explore with Wolfram|Alpha

References

Chatterjee, K.; Henzinger, M.; and Svozil, A. "Faster Algorithms for Mean-Payoff Parity Games." In Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Ed. K. G. Larsen, H. L. Bodlaender, and J.-F. Raskin). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, pp. 39:1-39:14, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.

Cite this as:

Weisstein, Eric W. "Mean-Payoff Game." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Mean-PayoffGame.html

Subject classifications