Research map / Learning theory and algorithms / Submodular and game algorithms
Exploitability Minimization in Games and Beyond
Denizalp Goktas, Amy Greenwald
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 |
|---|---|---|---|
| Use EDA or ADA instead of AMPQP | Monotone pseudo-games with jointly affine constraints · Monotone pseudo-games with jointly affine constraints | convergence to GNE | No clear effect |
| Use EDA instead of AMPQP | Monotone pseudo-games with jointly affine constraints · Monotone pseudo-games with jointly affine constraints | convergence rate | Hurt |
| Use ADA instead of AMPQP | Monotone pseudo-games with jointly affine constraints · Monotone pseudo-games with jointly affine constraints | convergence rate | Improved |
| Use EDA or ADA instead of AMPQP | Bilinear general-sum pseudo-games · Bilinear general-sum pseudo-games with jointly convex constraints | convergence: 93 of the 100 | Improved |
| Restart EDA or ADA with a new random initialization when it fails to converge | EDA and ADA · Bilinear general-sum pseudo-games with jointly convex constraints | restarts to converge to a GNE: 11 restarts for EDA and 10 restarts for ADA | Improved |
| Use EDA or ADA instead of AMPQP | Two-player zero-sum bilinear pseudo-games · Two-player zero-sum bilinear pseudo-games with jointly affine constraints | convergence rate | No clear effect |
| Use ADA instead of EDA or AMPQP | Two-player zero-sum bilinear pseudo-games · Two-player zero-sum bilinear pseudo-games with jointly affine constraints | convergence rate | Improved |
| Set the EDA regularization parameter to 1 | EDA · Two-player zero-sum bilinear pseudo-games with jointly convex constraints | convergence rate | Improved |
| Use ADA instead of EDA or AMPQP | Two-player zero-sum bilinear pseudo-games · Two-player zero-sum bilinear pseudo-games with jointly convex constraints | convergence rate | Improved |
Closest papers by meaning
- Constrained Phi-Equilibria (ICML 2023 · similarity 0.88)
- First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems (JMLR 2023 · similarity 0.87)
- The Complexity of Correlated Equilibria in Generalized Games (NeurIPS 2025 · similarity 0.86)
- Safe Subgame Resolving for Extensive Form Correlated Equilibrium (AAAI 2022 · similarity 0.86)
- Cost Minimization for Equilibrium Transition (AAAI 2024 · similarity 0.86)
- On Tractable $\Phi$-Equilibria in Non-Concave Games (NeurIPS 2024 · 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.
