Research map / Learning theory and algorithms / Submodular and game algorithms
Solving Imperfect-Recall Games via Sum-of-Squares Optimization
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
- No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium (NeurIPS 2020 · similarity 0.90)
- The Value of Recall in Extensive-Form Games (AAAI 2025 · similarity 0.90)
- Near-Optimal Learning of Extensive-Form Games with Imperfect Information (ICML 2022 · similarity 0.90)
- Ex ante coordination and collusion in zero-sum multi-player extensive-form games (NeurIPS 2018 · similarity 0.90)
- Learning Imperfect Information Extensive-form Games with Last-iterate Convergence under Bandit Feedback (ICML 2025 · similarity 0.89)
- A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence (ICLR 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.