Ioannis Anagnostides

Theory Comput. Syst., June, 2026

On the Complexity of Correlated Equilibria Beyond Normal-Form Games.

[BibT_eX]

[DOI]

Constantinos Daskalakis

CoRR, May, 2026

Decision Making under Imperfect Recall: Algorithms and Benchmarks.

[BibT_eX]

[DOI]

CoRR, February, 2026

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games.

[BibT_eX]

[DOI]

CoRR, February, 2026

Chaos in Autobidding Auctions.

[BibT_eX]

[DOI]

CoRR, February, 2026

Tight Inapproximability for Welfare-Maximizing Autobidding Equilibria.

[BibT_eX]

[DOI]

CoRR, February, 2026

Learning Potentials for Dynamic Matching and Application to Heart Transplantation.

[BibT_eX]

[DOI]

CoRR, February, 2026

Swap Regret Minimization Through Response-Based Approachability.

[BibT_eX]

[DOI]

CoRR, February, 2026

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives.

[BibT_eX]

[DOI]

CoRR, February, 2026

Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation.

[BibT_eX]

[DOI]

CoRR, February, 2026

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games.

[BibT_eX]

[DOI]

CoRR, January, 2026

On the Computational Complexity of Performative Prediction.

[BibT_eX]

[DOI]

CoRR, January, 2026

2025

Policy Optimization for Dynamic Heart Transplant Allocation.

[BibT_eX]

[DOI]

CoRR, December, 2025

The Complexity of Equilibrium Refinements in Potential Games.

[BibT_eX]

[DOI]

CoRR, November, 2025

Convergence of Regret Matching in Potential Games and Constrained Optimization.

[BibT_eX]

[DOI]

CoRR, October, 2025

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games.

[BibT_eX]

[DOI]

Brian Hu Zhang

CoRR, October, 2025

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition.

[BibT_eX]

[DOI]

CoRR, April, 2025

Computational Lower Bounds for No-Regret Learning in Normal-Form Games.

[BibT_eX]

[DOI]

Alkis Kalavasis

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Learning and Computation of Φ-Equilibria at the Frontier of Tractability.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Conference on Economics and Computation, 2025

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Expected Variational Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

The Value of Recall in Extensive-Form Games.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024

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

[BibT_eX]

[DOI]

Alkis Kalavasis

CoRR, 2024

Barriers to Welfare Maximization with No-Regret Learning.

[BibT_eX]

[DOI]

Alkis Kalavasis

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Steering No-Regret Learners to a Desired Equilibrium.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Efficient $\Phi$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Convergence of $\text{log}(1/\epsilon)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Steering No-Regret Learners to Optimal Equilibria.

[BibT_eX]

[DOI]

Stephen Marcus McAleer

Andreas Alexander Haupt

CoRR, 2023

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games.

[BibT_eX]

[DOI]

Emmanouil-Vasileios Vlatakis-Gkaragkounis

Fivos Kalogiannis

Ioannis Panageas

Stephen McAleer

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Gabriele Farina

Proceedings of the International Conference on Machine Learning, 2023

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games.

[BibT_eX]

[DOI]

Fivos Kalogiannis

Emmanouil V. Vlatakis-Gkaragkounis

Ioannis Panageas

Vaggos Chatziafratis

Stelios Andrew Stavroulakis

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Meta-Learning in Games.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Near-Optimal No-Regret Learning for General Convex Games.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games.

[BibT_eX]

[DOI]

Constantinos Daskalakis

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.

[BibT_eX]

[DOI]

Ioannis Panageas

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Dimensionality and Coordination in Voting: The Distortion of STV.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Accelerated Distributed Laplacian Solvers via Shortcuts.

[BibT_eX]

[DOI]

Themis Gouleakis

Christoph Lenzen

CoRR, 2021

Dimensionality, Coordination, and Robustness in Voting.

[BibT_eX]

[DOI]

CoRR, 2021

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model.

[BibT_eX]

[DOI]

Themis Gouleakis

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Metric-Distortion Bounds Under Limited Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Robust Learning under Strong Noise via SQs.

[BibT_eX]

[DOI]

Themis Gouleakis

Ali Marashian

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

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

[BibT_eX]

[DOI]

Paolo Penna

CoRR, 2020

Solving Zero-Sum Games through Alternating Projections.

[BibT_eX]

[DOI]

Paolo Penna

CoRR, 2020

Asymptotically Optimal Communication in Simple Mechanisms.

[BibT_eX]

[DOI]