A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games
Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino

TL;DR
This paper introduces a new finite-time algorithm for two-player zero-sum stochastic games that determines approximate stationary strategies or identifies significant value differences between initial positions, strengthening existing ergodicity results.
Contribution
The paper presents a novel potential transformation-based algorithm that provides constructive guarantees for $ ext{epsilon}$-ergodicity in stochastic games, improving upon prior existential results.
Findings
Algorithm guarantees $ ext{epsilon}$-ergodic strategies in finite time.
Identifies initial positions with value differences of at least $ ext{epsilon}/24$.
Strengthens the connection between $ ext{epsilon}$-ergodicity and stationary strategies.
Abstract
We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real , let us call a stochastic game -ergodic, if its values from any two initial positions differ by at most . The proposed new algorithm outputs for every in finite time either a pair of stationary strategies for the two players guaranteeing that the values from any initial positions are within an -range, or identifies two initial positions and and corresponding stationary strategies for the players proving that the game values starting from and are at least apart. In particular, the above result shows that if a stochastic game is -ergodic, then there are stationary strategies for the players proving -ergodicity. This result strengthens and provides a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Polynomial and algebraic computation · Game Theory and Voting Systems
