zero-sum games
In game theory, a zero-sum game is a scenario in which one player's gain is exactly balanced by the losses of another player. This concept applies to competitive learning environments in AI, particularly in multi-agent systems.
- Fast Zeroth-Order Convex Optimization with Quantum Gradient Methods
- From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
- Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
- Solving Neural Min-Max Games: The Role of Architecture, Initialization & Dynamics
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
- \(\varepsilon\)-Optimally Solving Two-Player Zero-Sum POSGs