Ioannis Panageas

Venues

Frequent coauthors

Papers

1. Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games
   NeurIPS 2025 ·

   Andreas Kontogiannis

   DBLP profile ↗ORCID search ↗
2. The Complexity of Finding Local Optima in Contrastive Learning
   NeurIPS 2025 ·

   Jingming Yan

   DBLP profile ↗ORCID search ↗
3. The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
   NeurIPS 2025 ·

   Ioannis Anagnostides

   DBLP profile ↗ORCID search ↗
4. Beating Price of Anarchy and Gradient Descent without Regret in Potential Games
   ICLR 2024 ·

   Iosif Sakos

   DBLP profile ↗ORCID search ↗
5. Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
   AAAI 2024 ·

   Nikolas Patris

   DBLP profile ↗ORCID search ↗
6. Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
   UAI 2024 ·

   Yi Feng

   DBLP profile ↗ORCID search ↗
7. Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
   NeurIPS 2024 ·

   Fivos Kalogiannis

   DBLP profile ↗ORCID search ↗
8. Learning Nash Equilibria in Rank-1 Games
   ICLR 2024 ·

   Nikolas Patris

   DBLP profile ↗ORCID search ↗
9. Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property
   AAAI 2024 ·

   Ioannis Anagnostides

   DBLP profile ↗ORCID search ↗
10. The Computational Complexity of Finding Second-Order Stationary Points
    ICML 2024 ·

    Andreas Kontogiannis

    DBLP profile ↗ORCID search ↗