Research map / Multi-agent systems and games / Games and equilibria
When are Offline Two-Player Zero-Sum Markov Games Solvable?
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
- Offline Learning in Markov Games with General Function Approximation (ICML 2023 · similarity 0.93)
- Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games (ICML 2024 · similarity 0.90)
- Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property (AAAI 2024 · similarity 0.89)
- Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning (NeurIPS 2025 · similarity 0.89)
- Can Reinforcement Learning Solve Asymmetric Combinatorial-Continuous Zero-Sum Games? (ICLR 2025 · similarity 0.89)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.88)
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.