Ioannis Anagnostides

Orcid: 0000-0002-8037-6360

According to our database1, Ioannis Anagnostides authored at least 36 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Computational Lower Bounds for Regret Minimization in Normal-Form Games.
CoRR, 2024

Barriers to Welfare Maximization with No-Regret Learning.
CoRR, 2024

Convergence of log(1/ε) for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis.
CoRR, 2024

Efficient Φ-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games.
CoRR, 2024

Steering No-Regret Learners to a Desired Equilibrium.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts.
Distributed Comput., December, 2023

Steering No-Regret Learners to Optimal Equilibria.
CoRR, 2023

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Interplay between Social Welfare and Tractability of Equilibria.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Near-Optimal Φ-Regret Learning in Extensive-Form Games.
Proceedings of the International Conference on Machine Learning, 2023

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Meta-Learning in Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Metric-Distortion Bounds under Limited Information.
J. Artif. Intell. Res., 2022

Sampling and Optimal Preference Elicitation in Simple Mechanisms.
CoRR, 2022

Near-Optimal No-Regret Learning for General Convex Games.
CoRR, 2022

Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer Games.
CoRR, 2022

Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Near-Optimal No-Regret Learning Dynamics for General Convex Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Uncoupled Learning Dynamics with <i>O(log T)</i> Swap Regret in Multiplayer Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Last-Iterate Convergence Beyond Zero-Sum Games.
Proceedings of the International Conference on Machine Learning, 2022

Dimensionality and Coordination in Voting: The Distortion of STV.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Accelerated Distributed Laplacian Solvers via Shortcuts.
CoRR, 2021

Dimensionality, Coordination, and Robustness in Voting.
CoRR, 2021

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Robust Learning under Strong Noise via SQs.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games.
CoRR, 2020

Solving Zero-Sum Games through Alternating Projections.
CoRR, 2020

Asymptotically Optimal Communication in Simple Mechanisms.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020


  Loading...