Theoretical computer science · Oct 6, 2026
Quasipolynomial algorithms for mean-payoff, stochastic and parity games
Gives deterministic algorithms using bit operations, for complete binary input length L, for ordinary mean-payoff games and two separate extensions. They compute exact values and optimal positional strategies in ordinary games, the nonnegative expectation-of-liminf value set in turn-based stochastic games, and the winning set for nonnegative liminf mean payoff conjoined with parity. Signed rewards, rational chance probabilities, and parity priorities are unrestricted and binary-encoded.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model