Independent policy-gradient algorithms provably compute approximate Nash equilibria in two-player zero-sum convex Markov games.
The rate of convergence of bregman proximal methods: Local geometry versus regularity versus sharpness
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Solving Zero-Sum Convex Markov Games
Independent policy-gradient algorithms provably compute approximate Nash equilibria in two-player zero-sum convex Markov games.