1 citations · 1 across the 5 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Last-Iterate Convergence of Policy Dynamics in Zero-Sum Networked Separable Markov Games
Zailin Ma
Solving Nash equilibria for general multi-player Markov games is computationally intractable, while two-player zero-sum Markov games admit fast last-iterate policy-optimization met…
cs.GT2023★ 1 cited
Near-Optimal Last-iterate Convergence of Policy Optimization in Zero-sum Polymatrix Markov games
Zailin Ma, Jiansheng Yang, Zhihua Zhang
Computing approximate Nash equilibria in multi-player general-sum Markov games is a computationally intractable task. However, multi-player Markov games with certain cooperative or…