cs.CCcs.GTcs.LGmath.OCTheoretical
The Complexity of Min-Max Optimization for Quadratic Polynomials
Jun 15, 2026
AI Summaryllama-3.1-8b-instruct
Computing approximate stationary points of min-max optimization over the hypercube is proven to be PPAD-hard for quadratic polynomials.
The paper provides the first PPAD-hardness results for two-team zero-sum polymatrix games.
Before reading this…
Applications
- →Game theory
- →Optimization
Skill Ladder
To understand this paper, make sure you know these concepts first:
- Polynomial optimizationfind papers →
- Game theoryfind papers →
Abstract
More Like ThisWe prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadratic polynomials. This holds even when the polynomials are multilinear, each variable appears in at most three monomials, and the approximation factor is inverse polynomial. As a direct consequence, we obtain the first PPAD-hardness results for two-team zero-sum polymatrix games.