Support-theoretic subgraph preconditioners for large-scale SLAM. - Yong-Dian Jian; Doru Balcan; Ioannis Panageas; Prasad Tetali; Frank Dellaert (IROS, 2013)

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras (CoRR, 2014)

The Complexity of Genetic Diversity: Sex with Two Chromosomes is Advantageous but Unpredictable. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras; Sadra Yazdanbod (CoRR, 2014)

Average Case Equilibria. - Ioannis Panageas; Georgios Piliouras (CoRR, 2014)

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras (ITCS, 2015)

The game of survival: Sexual evolution in dynamic environments. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras; Prasad Tetali; Vijay V. Vazirani (CoRR, 2015)

The Computational Complexity of Genetic Diversity. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras; Sadra Yazdanbod (ESA, 2016)

Mixing Time of Markov Chains, Dynamical Systems and Evolution. - Ioannis Panageas; Nisheeth K. Vishnoi (ICALP, 2016)

Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction. - Ioannis Panageas; Georgios Piliouras (EC, 2016)

Evolutionary Dynamics in Finite Populations Mix Rapidly. - Ioannis Panageas; Piyush Srivastava 001; Nisheeth K. Vishnoi (SODA, 2016)

Gradient Descent Converges to Minimizers: The Case of Non-Isolated Critical Points. - Ioannis Panageas; Georgios Piliouras (CoRR, 2016)

Evolutionary Markov chains, potential games and optimization under the lens of dynamical systems. - Ioannis Panageas (2016)

Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. - Tung Mai; Ioannis Panageas; Vijay V. Vazirani (ICALP, 2017)

Mutation, Sexual Reproduction and Survival in Dynamic Environments. - Ruta Mehta; Ioannis Panageas; Georgios Piliouras; Prasad Tetali; Vijay V. Vazirani (ITCS, 2017)

Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions. - Ioannis Panageas; Georgios Piliouras (ITCS, 2017)

Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos. - Gerasimos Palaiopanos; Ioannis Panageas; Georgios Piliouras (NIPS, 2017)

First-order Methods Almost Always Avoid Saddle Points. - Jason D. Lee; Ioannis Panageas; Georgios Piliouras; Max Simchowitz; Michael I. Jordan; Benjamin Recht (CoRR, 2017)

Rock-Paper-Scissors, Differential Games and Biological Diversity. - Tung Mai; Ioannis Panageas; Will Ratcliff; Vijay V. Vazirani; Peter Yunker (CoRR, 2017)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. - Constantinos Daskalakis; Ioannis Panageas (NeurIPS, 2018)

Cycles in Zero-Sum Differential Games and Biological Diversity. - Tung Mai; Milena Mihail; Ioannis Panageas; Will Ratcliff; Vijay V. Vazirani; Peter Yunker (EC, 2018)

Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always. - Ioannis Panageas; Georgios Piliouras; Xiao Wang 036 (ICML, 2019)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. - Constantinos Daskalakis; Ioannis Panageas (ITCS, 2019)

First-order methods almost always avoid saddle points: The case of vanishing step-sizes. - Ioannis Panageas; Georgios Piliouras; Xiao Wang 036 (NeurIPS, 2019)

Regression from dependent observations. - Constantinos Daskalakis; Nishanth Dikkala; Ioannis Panageas (STOC, 2019)

On the Convergence of EM for truncated mixtures of two Gaussians. - Sai Ganesh Nagarajan; Ioannis Panageas (CoRR, 2019)

First-order methods almost always avoid strict saddle points. - Jason D. Lee; Ioannis Panageas; Georgios Piliouras; Max Simchowitz; Michael I. Jordan; Benjamin Recht (Math. Program., 2019)

Logistic regression with peer-group effects via inference in higher-order Ising models. - Constantinos Daskalakis; Nishanth Dikkala; Ioannis Panageas (AISTATS, 2020)

On the Analysis of EM for truncated mixtures of two Gaussians. - Sai Ganesh Nagarajan; Ioannis Panageas (ALT, 2020)

Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem. - Vaggos Chatziafratis; Sai Ganesh Nagarajan; Ioannis Panageas; Xiao Wang 036 (ICLR, 2020)

Better depth-width trade-offs for neural networks through the lens of dynamical systems. - Vaggos Chatziafratis; Sai Ganesh Nagarajan; Ioannis Panageas (ICML, 2020)

Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev. - Xiao Wang 036; Qi Lei; Ioannis Panageas (NeurIPS, 2020)

Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently. - Ioannis Panageas; Stratis Skoulakis; Antonios Varvitsiotis; Xiao Wang 036 (CoRR, 2020)

Efficient Statistics for Sparse Graphical Models from Truncated Samples. - Arnab Bhattacharyya 001; Rathin Desai; Sai Ganesh Nagarajan; Ioannis Panageas (AISTATS, 2021)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes. - Qi Lei; Sai Ganesh Nagarajan; Ioannis Panageas; Xiao Wang 036 (AISTATS, 2021)

Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. - Ioannis Panageas; Thorben Tröbst; Vijay V. Vazirani (CoRR, 2021)

Teamwork makes von Neumann work: Min-Max Optimization in Two-Team Zero-Sum Games. - Fivos Kalogiannis; Ioannis Panageas; Emmanouil V. Vlatakis-Gkaragkounis (CoRR, 2021)

Independent Natural Policy Gradient always converges in Markov Potential Games. - Roy Fox; Stephen M. McAleer; Will Overman; Ioannis Panageas (AISTATS, 2022)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games. - Stefanos Leonardos; Will Overman; Ioannis Panageas; Georgios Piliouras (ICLR, 2022)

On Last-Iterate Convergence Beyond Zero-Sum Games. - Ioannis Anagnostides; Ioannis Panageas; Gabriele Farina; Tuomas Sandholm (ICML, 2022)

Accelerated Multiplicative Weights Update Avoids Saddle Points Almost Always. - Yi Feng; Ioannis Panageas; Xiao Wang 036 (IJCAI, 2022)

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. - Ioannis Anagnostides; Gabriele Farina; Ioannis Panageas; Tuomas Sandholm (NeurIPS, 2022)

On Scrambling Phenomena for Randomly Initialized Recurrent Networks. - Vaggos Chatziafratis; Ioannis Panageas; Clayton Sanford; Stelios Stavroulakis (NeurIPS, 2022)

Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. - Ioannis Anagnostides; Ioannis Panageas (SOSA, 2022)

Mean Estimation of Truncated Mixtures of Two Gaussians: A Gradient Based Approach. - Sai Ganesh Nagarajan; Gerasimos Palaiopanos; Ioannis Panageas; Tushar Vaidya; Samson Yu 001 (AAAI, 2023)

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. - Fivos Kalogiannis; Ioannis Anagnostides; Ioannis Panageas; Emmanouil V. Vlatakis-Gkaragkounis; Vaggos Chatziafratis; Stelios Andrew Stavroulakis (ICLR, 2023)

Towards convergence to Nash equilibria in two-team zero-sum games. - Fivos Kalogiannis; Ioannis Panageas; Emmanouil V. Vlatakis-Gkaragkounis (ICLR, 2023)

Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. - Ioannis Panageas; Stratis Skoulakis; Luca Viano; Xiao Wang 036; Volkan Cevher (ICML, 2023)

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. - Ioannis Anagnostides; Ioannis Panageas; Gabriele Farina; Tuomas Sandholm (NeurIPS, 2023)

On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails. - Yi Feng; Hu Fu 001; Qun Hu; Ping Li; Ioannis Panageas; Bo Peng; Xiao Wang 036 (NeurIPS, 2023)

Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria. - Fivos Kalogiannis; Ioannis Panageas (NeurIPS, 2023)

Exponential Lower Bounds for Fictitious Play in Potential Games. - Ioannis Panageas; Nikolas Patris; Stratis Skoulakis; Volkan Cevher (NeurIPS, 2023)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. - Ioannis Anagnostides; Fivos Kalogiannis; Ioannis Panageas; Emmanouil-Vasileios Vlatakis-Gkaragkounis; Stephen McAleer (EC, 2023)

Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. - Ioannis Anagnostides; Ioannis Panageas; Gabriele Farina; Tuomas Sandholm (AAAI, 2024)

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints. - Nikolas Patris; Stelios Stavroulakis; Fivos Kalogiannis; Rose Zhang; Ioannis Panageas (AAAI, 2024)

Learning Nash Equilibria in Rank-1 Games. - Nikolas Patris; Ioannis Panageas (ICLR, 2024)

Beating Price of Anarchy and Gradient Descent without Regret in Potential Games. - Iosif Sakos; Stefanos Leonardos; Stelios Andrew Stavroulakis; Will Overman; Ioannis Panageas; Georgios Piliouras (ICLR, 2024)

The Computational Complexity of Finding Second-Order Stationary Points. - Andreas Kontogiannis; Vasilis Pollatos; Sotiris Kanellopoulos; Panayotis Mertikopoulos; Aris Pagourtzis; Ioannis Panageas (ICML, 2024)

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem. - Fivos Kalogiannis; Jingming Yan; Ioannis Panageas (NeurIPS, 2024)

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games. - Yi Feng; Ping Li; Ioannis Panageas; Xiao Wang 036 (UAI, 2024)

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games. - Leello Tadesse Dadi; Ioannis Panageas; Stratis Skoulakis; Luca Viano; Volkan Cevher (CoRR, 2024)

Exact Learning of Weighted Graphs Using Composite Queries. - Michael T. Goodrich; Songyu Liu; Ioannis Panageas (IWOCA, 2025)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games. - Ioannis Anagnostides; Ioannis Panageas; Tuomas Sandholm; Jingming Yan (CoRR, 2025)