Reproduce “Strategy recovery for Mean-Payoff Games is as hard as solving them from scratch” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Dani Dorfman, Uri Zwick
The authors show that recovering optimal positional strategies in finite deterministic mean-payoff games is polynomial-time equivalent to solving the games from scratch. They establish this for recovery given all values, one player’s strategy, or a promise that every value is zero, using transformations and a self-reduction. These are reduction equivalences, but binary-weight games have deterministic quasipolynomial-time algorithms.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.