The Complexity of Two-Team Polymatrix Games with Independent Adversaries

Documenti analoghi

• The Complexity of Symmetric Bimatrix Games with Common Payoffs
  di: Ghosh, Abheek, et al.
  Pubblicazione: (2024)
• Tight Inapproximability of Nash Equilibria in Public Goods Games
  di: Dinh, Jérémi Do, et al.
  Pubblicazione: (2024)
• Polynomial Expectation Property for Max-Polymatrix Games
  di: Dai, Howard
  Pubblicazione: (2025)
• Envy-Free Cake-Cutting for Four Agents
  di: Hollender, Alexandros, et al.
  Pubblicazione: (2023)
• Generalized Individual Q-learning for Polymatrix Games with Partial Observations
  di: Donmez, Ahmed Said, et al.
  Pubblicazione: (2024)