Ioannis Anagnostides

PhD student, Carnegie Mellon University

1 paper at NeurIPS 2025

OpenReview· Semantic Scholar· Google Scholar

Poster Session 1

1 paper

Wednesday, December 3, 2025 · 11:00 AM → 2:00 PM

Exhibit Hall C,D,E

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games

#2913 Spotlight · Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan

We consider the computational complexity of computing stationary points in min-max optimization, with a particular focus on the special case of computing Nash equilibria in (two-)team zero-sum games.