AIProofWatch
← Archive
algorithmic improvementai assisted

OpenAI reports: Stochastic mean-payoff games

The manuscript reports a deterministic quasipolynomial algorithm for the nonnegative-value vertices of finite turn-based stochastic mean-payoff games.

Sources for this record

What was already known

The target counts bit operations in the complete binary input length, including rewards and rational transition probabilities.

What changed and why it matters

Supplies a general quasipolynomial algorithm for the stated stochastic mean-payoff game class, a broad computational advance.

The AI contribution

OpenAI attributes the manuscript to an internal frontier model. This entry does not infer the exact human contribution to this individual result from the release-wide description.

Limitations

Quasipolynomial is not polynomial time. The threshold, payoff definition, and turn-based model must match the theorem. Preprint. AIProofWatch reviewed the source statement and scope, not the full proof, and has not independently run a formal checker.

Verification evidence

Evidence labels show what supports the claim. Importance rates its impact if correct.

Author claim

Reported theorem in the pinned manuscript. This records the claim, not an independent proof check.

Accessible artifact / proof

Manuscript proof is accessible. Formalization availability alone is not labelled as successful formal verification.

Correction and publication history

2026-10-11 · amendment

Editorial importance reassessment: rate the scoped impact if correct independently from verification. The claim, limitations, sources, and verification evidence are unchanged.

Read this published revision