arXiv Machine Learning By Eason Yu, Tzu Hao Liu, Cl\'ement L. Canonne, Yunke Wang, Chang Xu, Nguyen H. Tran, Stefano V. Albrecht

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria

Read the original on arXiv Machine Learning →

arXiv:2510. 18183v3 Announce Type: replace Abstract: Finding Nash equilibria in two-player zero-sum imperfect-information games remains a central challenge in multi-agent reinforcement learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 2

NashDreamer: Model-Based Reinforcement Learning for Zero-Sum Imperfect-Information Games

NashDreamer is a new model-based reinforcement learning framework designed for two-player zero-sum imperfect-information games. It introduces a centralized Multi-Agent Recurrent State-Space Model that separates environment dynamics from player strategy effects, enabling the use of any policy gradient algorithm while preserving convergence guarantees to Nash equilibria. Experiments on four benchmark games show that NashDreamer achieves significantly better sample efficiency than model-free baselines early in training, and the authors analyze its optimization landscape, noting a potential vulnerability to posterior collapse in stochastic settings.

By Tom\'a\v{s} Hole\v{c}ek, Viliam Lis\'y
arXiv AI
Jun 24

EMAgnet: Parameter-Space EMA Regularization for Policy Gradient Self-Play in Large Games

arXiv:2606. 23995v1 Announce Type: cross Abstract: Recent work has established that regularized policy gradient methods such as PPO, when used in self-play, can match or exceed specialized game-theoretic algorithms for solving two-player zero-sum imperfect-information games.

By Tristan Maidment, JB Lanier, Chase McDonald, Nathan Tsang, Eugene Vinitsky, Roy Fox, Albert Wang, Wesley N. Kerr