arXiv (All)
open access
Symmetric Policy Optimization for Zero-Sum Markov Games
We propose a simple and symmetric method for policy optimization in discounted zero-sum Markov games. The method, termed symmetric policy iteration, operates by evaluating the joint policy and solving the corresponding regularized matrix game at each iteration. By employing a diminishing sequence of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms#1492922
- Reinforcement Learning in MDPs with Information-Ordered Policies#1386193
- Two-Person Additively-Separable Sum Games#1441881
- General-Sum Markov Games with Borel Spaces: Existence of Approximate Nash Equilibria via Finite Model Approximations under Setwise or Weak Continuity#1402912
- Toward Online Robust Zero-Sum Markov Games with Function Approximation#1401462
Record · ID 1490723
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive