Research map / Learning theory and algorithms / Submodular and game algorithms
Representation Learning for Low-rank General-sum Markov Games
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 Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently? (ICLR 2022 · similarity 0.92)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.89)
- Solving Zero-Sum Markov Games with Continuous State via Spectral Dynamic Embedding (NeurIPS 2024 · similarity 0.88)
- Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games (ICML 2024 · similarity 0.88)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.88)
- Sample-Efficient Multi-Agent RL: An Optimization Perspective (ICLR 2024 · 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.