Ioannis Anagnostides

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 50

Top Topics

Regret Minimization

Top Venues

Publications

Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR (2024)
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS (2024)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI (2024)
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML (2023)
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR (2023)
Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Andrew Stavroulakis
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR (2023)
Ioannis Anagnostides, Tuomas Sandholm
On the Interplay between Social Welfare and Tractability of Equilibria. CoRR (2023)
Ioannis Anagnostides, Tuomas Sandholm
On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS (2023)
Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. EC (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR (2023)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR (2023)
Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm
Meta-Learning in Games. ICLR (2023)
Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. CoRR (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Steering No-Regret Learners to Optimal Equilibria. CoRR (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR (2023)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36 (4) (2023)
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS (2023)
Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm
Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS (2022)
Ioannis Anagnostides, Ioannis Panageas
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. SOSA (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm
Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR (2022)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Sampling and Optimal Preference Elicitation in Simple Mechanisms. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Tuomas Sandholm
Swap Regret in Multiplayer Games. NeurIPS (2022)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Dimensionality and Coordination in Voting: The Distortion of STV. AAAI (2022)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Metric-Distortion Bounds under Limited Information. J. Artif. Intell. Res. 74 (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC (2022)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML (2022)
Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, Tuomas Sandholm
Near-Optimal No-Regret Learning for General Convex Games. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS (2022)
Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR (2022)
Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm
Meta-Learning in Games. CoRR (2022)
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC (2022)
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC (2022)
Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Stavroulakis
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. CoRR (2022)
Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR (2022)
Ioannis Anagnostides, Themis Gouleakis, Ali Marashian
Robust Learning under Strong Noise via SQs. AISTATS (2021)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Metric-Distortion Bounds Under Limited Information. SAGT (2021)
Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen
Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR (2021)
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR (2021)
Ioannis Anagnostides, Themis Gouleakis
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. CoRR (2021)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Metric-Distortion Bounds under Limited Information. CoRR (2021)
Ioannis Anagnostides, Themis Gouleakis
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. DISC (2021)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Dimensionality, Coordination, and Robustness in Voting. CoRR (2021)
Ioannis Anagnostides, Paolo Penna
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR (2020)
Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
Asymptotically Optimal Communication in Simple Mechanisms. SAGT (2020)
Ioannis Anagnostides, Themis Gouleakis, Ali Marashian
Robust Learning under Strong Noise via SQs. CoRR (2020)
Ioannis Anagnostides, Paolo Penna
Solving Zero-Sum Games through Alternating Projections. CoRR (2020)