Governing Strategic Dynamics: Equilibrium Stabilization via Divergence-Driven Control
Not on the map. Why?
Abstract (arXiv)
Black-box coevolution in mixed-motive games is often undermined by opponent-drift non-stationarity and noisy rollouts, which distort progress signals and can induce cycling, Red-Queen dynamics, and detachment. We propose the Marker Gene Method (MGM), a curriculum-inspired governance mechanism that stabilizes selection by anchoring evaluation to cross-generational marker individuals, together with DWAM and conservative marker-update rules to reduce spurious updates. We also introduce NGD-Div, which adapts the key update threshold using a divergence proxy and natural-gradient optimization. We provide theoretical analysis in strictly competitive settings and evaluate MGM integrated with evolution strategies (MGM-E-NES) on coordination games and a resource-depletion Markov game. MGM-E-NES reliably recovers target coordination in Stag Hunt and Battle of the Sexes, achieving final cooperation probabilities close to (1,1) (e.g., 0.991±0.01/1.00±0.00 and 0.97±0.00/0.97±0.00 for the two players). In the Markov resource game, it maintains high and stable state-conditioned cooperation across 30 seeds, with final cooperation of ≈ 0.954/0.980/0.916 in textscRich/textscPoor/textscCollapsed (both players; small standard deviations), indicating welfare-aligned and state-dependent behavior. Overall, MGM-E-NES transfers across tasks with minimal hyperparameter changes and yields consistently stable training dynamics, showing that top-level governance can substantially improve the robustness of black-box coevolution in dynamic environments.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 50 references that are in the map. First posted on arXiv 30 Jun 2025.
Builds on
12 of 50 references.
References · 12
- 2017A Unified Game-Theoretic Approach to Multiagent Reinforcement Learningcited by 268
- 2018The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimizationcited by 101
- 2022Proximal Learning With Opponent-Learning Awarenesscited by 20
- 2022Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete timecited by 10
- 2025Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Playcited by 3
- 2013Coevolution and correlated multiplexity in multiplex networkscited by 2
- 2017Addressing Expensive Multi-objective Games with Postponed Preference Articulation via Memetic Co-evolutioncited by 2
- 2023Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regretcited by 2
- 2014Cyclic dominance in evolutionary games: A reviewcited by 1
- 2015Coevolutionary intransitivity in games: A landscape analysiscited by 1
- 2024Beyond Nash Equilibrium: Achieving Bayesian Perfect Equilibrium with Belief Update Fictitious Playcited by 1
- 2025Approximating Nash Equilibria in General-Sum Games via Meta-Learningcited by 1
Built on by
Not cited yet.