Research map / Learning theory and algorithms / Submodular and game algorithms
Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
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
- Computing Optimal Nash Equilibria in Multiplayer Games (NeurIPS 2023 · similarity 0.90)
- Exclusion Method for Finding Nash Equilibrium in Multiplayer Games (AAAI 2017 · similarity 0.89)
- Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games (ICML 2025 · similarity 0.87)
- Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization (ICLR 2024 · similarity 0.87)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.87)
- The Complexity of Correlated Equilibria in Generalized Games (NeurIPS 2025 · similarity 0.87)
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.