Uniform epsilon-equilibrium in finite multiplayer stochastic games

For every finite stochastic game with bounded stage payoffs, every epsilon>0, and every initial state s_0, prove that there are a behavioral-strategy profile sigma and N such that for every horizon n>=N no player can improve that player's expected n-stage average payoff by more than epsilon through any unilateral behavioral deviation.

Source: Math Conjectures, GAME-001, catalog snapshot 31 July 2026..

Status Open · subcases solved Status review date not recorded in this edition

Listed by ProofAtlas. Status qualification is attributed to ProofAtlas; no full resolution is certified here.