Research map / Optimization / Nonconvex and smooth optimization
On the convergence of policy gradient methods to Nash equilibria in general stochastic games
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-Action Selection in General Stochastic Games under Regularized Policy Gradient Methods (NeurIPS 2026 · similarity 0.93)
- Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property (AAAI 2024 · similarity 0.92)
- Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence (ICML 2022 · similarity 0.92)
- Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown Transitions (NeurIPS 2022 · similarity 0.92)
- A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence (ICLR 2025 · similarity 0.91)
- Solving Zero-Sum Convex Markov Games (ICML 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.