A Multi-Step Minimax Q-learning Algorithm for Two-Player Zero-Sum Markov Games
Machine Learning
2025-09-23 v2
Abstract
An interesting iterative procedure is proposed to solve a two-player zero-sum Markov games. Under suitable assumption, the boundedness of the proposed iterates is obtained theoretically. Using results from stochastic approximation, the almost sure convergence of the proposed two-step minimax Q-learning is obtained theoretically. More specifically, the proposed algorithm converges to the game theoretic optimal value with probability one, when the model information is not known. Numerical simulation authenticate that the proposed algorithm is effective and easy to implement.
Keywords
Cite
@article{arxiv.2407.04240,
title = {A Multi-Step Minimax Q-learning Algorithm for Two-Player Zero-Sum Markov Games},
author = {Shreyas S R and Antony Vijesh},
journal= {arXiv preprint arXiv:2407.04240},
year = {2025}
}