Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games

Ähnliche Einträge

• The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
  von: Anagnostides, Ioannis, et al.
  Veröffentlicht: (2025)
• Efficiently Computing Equilibria in Budget-Aggregation Games
  von: Becker, Patrick, et al.
  Veröffentlicht: (2025)
• On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
  von: Cheval, Vincent, et al.
  Veröffentlicht: (2025)
• $\widetilde{O}(T^{-1})$ Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Games
  von: Mao, Weichao, et al.
  Veröffentlicht: (2024)
• Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
  von: Zhang, Brian, et al.
  Veröffentlicht: (2022)