Steering Equilibrium Selection in Regularized Self-Play via the Reference Policy
Not on the map. Why?
Abstract (arXiv)
Regularized self-play -- the family behind DeepNash's Stratego play -- drives a two-player zero-sum policy to a Nash equilibrium by best-responding to a slowly moving, entropy-regularized reference policy ρ. When the game has a polytope of value-equivalent equilibria, the regularizer silently breaks the tie: with a uniform reference it selects the maximum-entropy member, the I-projection of ρ onto the Nash set. Can the reference be used to choose the equilibrium on purpose? On five exactly solvable games plus a 2-D polytope, with exact best responses and equivalence tests over independent seeds, anchoring the reference at a target member and refining steers self-play to that member with mean coordinate error 0.007 at median exploitability 5×10-5, TOST-equivalent to the request within ±0.05; the anchoring persists through refinement and follows the reference, not the initialization. Selection follows the reach-weighted I-projection (slope 0.969 [0.950, 0.987]). We report with equal emphasis where the story breaks: fixed off-manifold references cost 0.08-0.25 exploitability; stiff or flat families require a smaller mirror step, set by a pre-registered rule; boundary targets undershoot; curvature predicts where boundary saturation bites (rank correlation 0.90, p=0.037) while interior precision is curvature-independent. Table and MLP steering maps are equivalent within ±0.03 at every target (30 seeds); matched control arms show attention's robust signature is excess seed variance, any systematic shift bounded at 0.018 and not significant. Against a best response the selection-robustness trade-off is degenerate: steering matters only against fixed, non-equilibrium opponents. The recipe -- anchor the reference at the desired member and refine -- reinterprets the KL anchor of RLHF-style RL as a selection knob, not only a stability leash.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 17 references that are in the map. First posted on arXiv 17 Sep 2026.
Builds on
8 of 17 references.
References · 8
- 2022Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learningcited by 131
- 2017Cycles in adversarial regularized learningcited by 124
- 2014Solving Large Imperfect Information Games Using CFR+cited by 78
- 2022A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Gamescited by 66
- 2020From Poincar'e Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularizationcited by 61
- 2025NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibriacited by 2
- 2026Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopescited by 2
- 2026The Curvature Shadow: An Apparent Failure of Maximum-Entropy Equilibrium Selection is a Removable Artifactcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026EMAgnet: Parameter-Space EMA Regularization for Policy Gradient Self-Play in Large Games
- 2026DiffNash: Finding Nash Equilibrium in High-Dimensional Continuous Action Spaces with Diffusion Policies
- 2025Proximal Point Nash Learning from Human Feedback
- 2026Data-Augmented Game Starts for Accelerating Self-Play Exploration in Imperfect Information Games
- 2025Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
- 2026Equilibrium Selection in Multi-Agent Policy Gradients via Opponent-Aware Basin Entry
- 2025RSPO: Regularized Self-Play Alignment of Large Language Models
- 2026Pessimism-Free Offline Learning in General-Sum Games via KL Regularization