Research map / Learning theory and algorithms / Submodular and game algorithms
Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure
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
- Tight Inapproximability for Graphical Games (AAAI 2023 · similarity 0.92)
- On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games (AAAI 2021 · similarity 0.91)
- An Improved Quasi-Polynomial Algorithm for Approximate Well-Supported Nash Equilibria (AAAI 2019 · similarity 0.91)
- Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games (NeurIPS 2024 · similarity 0.86)
- The Complexity of Two-Team Polymatrix Games with Independent Adversaries (ICLR 2025 · similarity 0.86)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.85)
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.