Research map / Optimization / Nonconvex and smooth optimization
Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games
Zihan Zhu, Ethan X Fang, Zhuoran Yang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| run OPGD in the linear parametric setting for 10,000 iterations | OPGD · two-agent linear decision-dependent game | squared error to Nash equilibrium (rate) | Improved |
| run OPGD in the RKHS setting for 10,000 iterations | OPGD · two-agent RKHS decision-dependent game | squared error to Nash equilibrium (rate) | Improved |
Closest papers by meaning
- Multiplayer Performative Prediction: Learning in Decision-Dependent Games (JMLR 2023 · similarity 0.93)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 2024 · similarity 0.89)
- Decentralized Noncooperative Games with Coupled Decision-Dependent Distributions (NeurIPS 2024 · similarity 0.88)
- From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications (NeurIPS 2025 · similarity 0.88)
- Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem (NeurIPS 2024 · similarity 0.88)
- Constrained Exploitability Descent: An Offline Reinforcement Learning Method for Finding Mixed-Strategy Nash Equilibrium (ICML 2025 · 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.
