Michael Sullins and one other author submitted a paper titled IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence on 13 October 2026.[1] Regret matching and its variants are central in practice for solving normal-form and extensive-form games, but have historically lacked strong theoretical convergence guarantees.[1] The authors report that previous-utility prediction recovers constant-regret and convergence-rate guarantees for both simultaneous and alternating IR-PRM+ updates in finite two-player zero-sum matrix games.[1] They also report the current duality gap vanishes and the current profile converges to the Nash equilibrium set, with analysis extended to extensive-form games via the IR-PCFR+ variant.[1]