Research map / Learning theory and algorithms / Submodular and game algorithms
Scalable Solutions to Zero-Sum Partially Observable Stochastic Games Through Belief Aggregation with Approximation Guarantees
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
- State-Constrained Zero-Sum Differential Games with One-Sided Information (ICML 2024 · similarity 0.87)
- Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms (NeurIPS 2024 · similarity 0.86)
- Robust PAC Learning of Concurrent Stochastic Games (NeurIPS 2026 · similarity 0.86)
- A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence (ICLR 2025 · similarity 0.86)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.86)
- Solving Hierarchical Information-Sharing Dec-POMDPs: An Extensive-Form Game Approach (ICML 2024 · similarity 0.86)
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.