A Parallelizable Approach for Characterizing NE in Zero-Sum Games After a Linear Number of Iterations of Gradient Descent

Documenti analoghi

• Breaking $1/ε$ Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes
  di: Su, Yiheng, et al.
  Pubblicazione: (2025)
• A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights
  di: Legacci, Davide, et al.
  Pubblicazione: (2024)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
  di: Vasconcelos, Francisca, et al.
  Pubblicazione: (2023)
• Robust equilibria in continuous games: From strategic to dynamic robustness
  di: Lotidis, Kyriakos, et al.
  Pubblicazione: (2025)
• Accelerated regularized learning in finite N-person games
  di: Lotidis, Kyriakos, et al.
  Pubblicazione: (2024)