OpenAI · 104-04 · 2026-09-25 · Theoretical computer science
Randomized quasipolynomial-time mean-payoff games
preprints/Randomized-quasipolynomial-time-mean-payoff-games-September-25-2026
Family 104. Quasipolynomial algorithms for mean-payoff, stochastic and parity games.
The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.
Read against the standing problems
Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N
Gives deterministic algorithms using bit operations, for complete binary input length , 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.
We give a randomized algorithm that computes the complete zero-threshold winning set of a finite mean-payoff game with arbitrary signed integer edge weights encoded in binary. For total explicit input length L, it uses bit operations on every random tape and is correct with probability at least 7/8. A polynomial-time check certifies the winning regions and positional strategies for both players or reports failure. Independent repetition therefore gives an always-correct algorithm with the same expected quasipolynomial bit bound.
Preprint source and Lean scope
The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.
This preprint is named in the Lean scope note for 104: Quasipolynomial algorithms for mean-payoff, stochastic and parity games. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.