Research map / Optimization / Nonconvex and smooth optimization
Policy Gradient Methods Find the Nash Equilibrium in N-player General-sum Linear-quadratic Games
Ben Hambly, Renyuan Xu, Huining Yang
Read the paperCheck your idea against 137,217 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
- Policy Optimization Provably Converges to Nash Equilibria in Zero-Sum Linear Quadratic Games (NeurIPS 2019 · similarity 0.93)
- On the convergence of policy gradient methods to Nash equilibria in general stochastic games (NeurIPS 2022 · similarity 0.92)
- Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property (AAAI 2024 · similarity 0.91)
- Solving Zero-Sum Convex Markov Games (ICML 2025 · similarity 0.89)
- A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence (ICLR 2025 · similarity 0.89)
- Solving Zero-Sum Markov Games with Continuous State via Spectral Dynamic Embedding (NeurIPS 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.
