Ioannis Anagnostides

80 papers A* 23A 4B 2Journal 50Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Nikolas Patris, Tuomas Sandholm
2026	J	`jnl`	Algorithms and complexity for computing Nash equilibria in adversarial team games. Games Econ. Behav. Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen M. McAleer
2026	J	`jnl`	Chaos in Autobidding Auctions. CoRR Ioannis Anagnostides, Ian Gemp, Georgios Piliouras, Kelly Spendlove
2026	J	`jnl`	Decision Making under Imperfect Recall: Algorithms and Benchmarks. CoRR Emanuel Tewolde, Brian Hu Zhang, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2026	J	`jnl`	Learning Potentials for Dynamic Matching and Application to Heart Transplantation. CoRR Itai Zilberstein, Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation. CoRR Itai Zilberstein, Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	On the Computational Complexity of Performative Prediction. CoRR Ioannis Anagnostides, Rohan Chauhan, Ioannis Panageas, Tuomas Sandholm, Jingming Yan
2026	J	`jnl`	Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives. CoRR Ioannis Anagnostides, Itai Zilberstein, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2026	J	`jnl`	Swap Regret Minimization Through Response-Based Approachability. CoRR Ioannis Anagnostides, Gabriele Farina, Maxwell Fishelson, Haipeng Luo, Jon Schneider
2026	J	`jnl`	The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Kiriaki Fragkia, Maria-Florina Balcan, Tuomas Sandholm
2026	J	`jnl`	Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria. CoRR Ioannis Anagnostides, Ian Gemp, Georgios Piliouras, Kelly Spendlove
2025	J	`jnl`	A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition. CoRR Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm, Brian Hu Zhang
2025	A*	`conf`	Computational Lower Bounds for No-Regret Learning in Normal-Form Games. STOC Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2025	J	`jnl`	Convergence of Regret Matching in Potential Games and Constrained Optimization. CoRR Ioannis Anagnostides, Emanuel Tewolde, Brian Hu Zhang, Ioannis Panageas, Vincent Conitzer, Tuomas Sandholm
2025	A*	`conf`	Expected Variational Inequalities. ICML Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	Expected Variational Inequalities. CoRR Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	A*	`conf`	Learning and Computation of Φ-Equilibria at the Frontier of Tractability. EC Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	Learning and Computation of Φ-Equilibria at the Frontier of Tractability. CoRR Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
2025	J	`jnl`	Policy Optimization for Dynamic Heart Transplant Allocation. CoRR Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
2025	J	`jnl`	Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Tuomas Sandholm
2025	J	`jnl`	The Complexity of Equilibrium Refinements in Potential Games. CoRR Ioannis Anagnostides, Maria-Florina Balcan, Kiriaki Fragkia, Tuomas Sandholm, Emanuel Tewolde, Brian Hu Zhang
2025	J	`jnl`	The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan
2025	A*	`conf`	The Value of Recall in Extensive-Form Games. AAAI Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2024	J	`jnl`	Barriers to Welfare Maximization with No-Regret Learning. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2024	J	`jnl`	Computational Lower Bounds for Regret Minimization in Normal-Form Games. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm
2024	A*	`conf`	Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. NeurIPS Ioannis Anagnostides, Tuomas Sandholm
2024	J	`jnl`	Convergence of log(1/ε) for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis. CoRR Ioannis Anagnostides, Tuomas Sandholm
2024	A*	`conf`	Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. NeurIPS Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2024	J	`jnl`	Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games. CoRR Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2024	A	`conf`	On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. ITCS Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
2024	A*	`conf`	Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2024	A*	`conf`	Steering No-Regret Learners to a Desired Equilibrium. EC Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2024	J	`jnl`	The Value of Recall in Extensive-Form Games. CoRR Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer
2023	A*	`conf`	Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. EC Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer
2023	J	`jnl`	Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. CoRR Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer
2023	J	`jnl`	Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2023	A*	`conf`	Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. NeurIPS Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen McAleer, Andreas A. Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2023	J	`jnl`	Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games. CoRR Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2023	A*	`conf`	Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Andrew Stavroulakis
2023	A*	`conf`	Meta-Learning in Games. ICLR Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Steven Wu, Tuomas Sandholm
2023	A*	`conf`	Near-Optimal Φ-Regret Learning in Extensive-Form Games. ICML Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. CoRR Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, Manolis Zampetakis
2023	A*	`conf`	On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	A*	`conf`	On the Interplay between Social Welfare and Tractability of Equilibria. NeurIPS Ioannis Anagnostides, Tuomas Sandholm
2023	J	`jnl`	On the Interplay between Social Welfare and Tractability of Equilibria. CoRR Ioannis Anagnostides, Tuomas Sandholm
2023	J	`jnl`	Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2023	J	`jnl`	Steering No-Regret Learners to Optimal Equilibria. CoRR Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides, Federico Cacciamani, Stephen Marcus McAleer, Andreas Alexander Haupt, Andrea Celli, Nicola Gatti, Vincent Conitzer, Tuomas Sandholm
2022	A	`conf`	Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2022	A*	`conf`	Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
2022	A*	`conf`	Dimensionality and Coordination in Voting: The Distortion of STV. AAAI Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2022	J	`jnl`	Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. CoRR Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Stavroulakis
2022	A*	`conf`	Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. EC Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
2022	J	`jnl`	Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria. CoRR Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Andrea Celli, Tuomas Sandholm
2022	—	`conf`	Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. SOSA Ioannis Anagnostides, Ioannis Panageas
2022	J	`jnl`	Meta-Learning in Games. CoRR Keegan Harris, Ioannis Anagnostides, Gabriele Farina, Mikhail Khodak, Zhiwei Steven Wu, Tuomas Sandholm
2022	J	`jnl`	Metric-Distortion Bounds under Limited Information. J. Artif. Intell. Res. Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2022	J	`jnl`	Near-Optimal $Φ$-Regret Learning in Extensive-Form Games. CoRR Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Near-Optimal No-Regret Learning Dynamics for General Convex Games. NeurIPS Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-wei Lee, Christian Kroer, Tuomas Sandholm
2022	J	`jnl`	Near-Optimal No-Regret Learning for General Convex Games. CoRR Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-wei Lee, Christian Kroer, Tuomas Sandholm
2022	A*	`conf`	Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. STOC Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
2022	A*	`conf`	On Last-Iterate Convergence Beyond Zero-Sum Games. ICML Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2022	J	`jnl`	On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm
2022	A*	`conf`	Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
2022	J	`jnl`	Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm
2022	J	`jnl`	Sampling and Optimal Preference Elicitation in Simple Mechanisms. CoRR Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2022	A*	`conf`	Uncoupled Learning Dynamics with NeurIPS Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-wei Lee, Haipeng Luo, Tuomas Sandholm
2022	J	`jnl`	Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games. CoRR Ioannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-wei Lee, Haipeng Luo, Tuomas Sandholm
2021	J	`jnl`	Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR Ioannis Anagnostides, Themis Gouleakis, Christoph Lenzen
2021	A	`conf`	Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. DISC Ioannis Anagnostides, Themis Gouleakis
2021	J	`jnl`	Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. CoRR Ioannis Anagnostides, Themis Gouleakis
2021	J	`jnl`	Dimensionality, Coordination, and Robustness in Voting. CoRR Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2021	B	`conf`	Metric-Distortion Bounds Under Limited Information. SAGT Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2021	J	`jnl`	Metric-Distortion Bounds under Limited Information. CoRR Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2021	J	`jnl`	Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games. CoRR Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm
2021	A	`conf`	Robust Learning under Strong Noise via SQs. AISTATS Ioannis Anagnostides, Themis Gouleakis, Ali Marashian
2020	J	`jnl`	A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR Ioannis Anagnostides, Paolo Penna
2020	B	`conf`	Asymptotically Optimal Communication in Simple Mechanisms. SAGT Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos
2020	J	`jnl`	Robust Learning under Strong Noise via SQs. CoRR Ioannis Anagnostides, Themis Gouleakis, Ali Marashian
2020	J	`jnl`	Solving Zero-Sum Games through Alternating Projections. CoRR Ioannis Anagnostides, Paolo Penna