Research map / Learning theory and algorithms / Submodular and game algorithms
Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
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
- Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback (NeurIPS 2023 · similarity 0.92)
- Decentralized Q-learning in Zero-sum Markov Games (NeurIPS 2021 · similarity 0.92)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.91)
- The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback (ICML 2025 · similarity 0.91)
- Learning Imperfect Information Extensive-form Games with Last-iterate Convergence under Bandit Feedback (ICML 2025 · similarity 0.90)
- Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property (AAAI 2024 · similarity 0.90)
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.