Research map / Optimization / Nonconvex and smooth optimization
Offline Two-Player Zero-Sum Markov Games with KL Regularization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- When are Offline Two-Player Zero-Sum Markov Games Solvable? (NeurIPS 2022 · similarity 0.93)
- Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback (NeurIPS 2023 · similarity 0.93)
- Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms (NeurIPS 2024 · similarity 0.92)
- The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback (ICML 2025 · similarity 0.90)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.89)
- From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications (NeurIPS 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.