Regularized minimax-V learning for solving randomly terminating two-player zero-sum Markov games

DOI10.1007/978-981-96-8312-3_24MaRDI QIDQ6897266zbMATH OpenFDO

Authors Xinxiang Guo, Yifen Mu

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-8312-3_24

zbMATH Keywords

accelerating techniqueEuclidean regularizationMarkov gameV-value iteration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• DeepStack: expert-level artificial intelligence in heads-up no-limit poker
• Fast global convergence of natural policy gradient methods with entropy regularization
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 1233801 (Why is no real title available?)
• Multi-agent reinforcement learning: a selective overview of theories and algorithms
• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• Stochastic Games

This page was built for publication: Regularized minimax-V learning for solving randomly terminating two-player zero-sum Markov games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897266)