Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints

Documenti analoghi

• Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
  di: Kalogiannis, Fivos, et al.
  Pubblicazione: (2024)
• Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
  di: Anagnostides, Ioannis, et al.
  Pubblicazione: (2023)
• (Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
  di: Anagnostides, Ioannis, et al.
  Pubblicazione: (2026)
• Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
  di: Barakat, Anas, et al.
  Pubblicazione: (2026)
• The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
  di: Anagnostides, Ioannis, et al.
  Pubblicazione: (2025)