3 citations · 6 across the 27 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
The Complexity of Min-Max Optimization for Quadratic Polynomials
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
We 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 mu…
cs.CC2026★ 1 cited
The Complexity of Min-Max Optimization with Product Constraints
Martino Bernasconi, Matteo Castiglioni
We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function . From the work of Daskalakis, S…