Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: 104-01. Turn-Based Stochastic Mean-Payoff Games in Deterministic Quasipolynomial Time
Manuscript map · lines 4505–4514
OpenAI@2026-10-07#rem:oai-p-104-01
Authors: OpenAI. Family 104.
Title: Turn-Based Stochastic Mean-Payoff Games in Deterministic Quasipolynomial Time.
Abstract: We give a uniform deterministic quasipolynomial-time algorithm for finite turn-based stochastic mean-payoff games with signed integer rewards and rational chance-transition probabilities encoded in binary. It computes exactly the vertices of nonnegative value, including value zero, for the expectation of the pathwise liminf mean payoff. The algorithm uses exact rational arithmetic and $2{}{O(({}log(L+2)){}2)}$ bit operations, where L is the complete binary input length.
This abstract is a catalogue record. It is not a verification and not a premise. It does not close O.1. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- section: Manuscript map
- remark: Remark: 001-01. Milne's rationality conjecture for abelian varieties
- remark: Remark: 002-01. Exact Birch–Swinnerton-Dyer Formula from Low Selmer Corank
- remark: Remark: 002-02. The Selmer converse for elliptic curves at every prime
- remark: Remark: 002-03. The two-primary Birch–Swinnerton-Dyer formula in Selmer corank at most one
- remark: Remark: 003-01. The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane s 7/8
- remark: Remark: 003-02. The Quasi-Riemann Hypothesis (alternate 11/12 proof)
- remark: Remark: 003-03. Uniform exclusion of Landau–Siegel zeros