:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Anagnostides, Ioannis, Chauhan, Rohan, Panageas, Ioannis, Sandholm, Tuomas, Yan, Jingming
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2601.20180
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

Barriers to Welfare Maximization with No-Regret Learning
by: Anagnostides, Ioannis, et al.
Published: (2024)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
by: Chauhan, Rohan, et al.
Published: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

Policy Optimization for Dynamic Heart Transplant Allocation
by: Anagnostides, Ioannis, et al.
Published: (2025)

Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
by: Anagnostides, Ioannis, et al.
Published: (2024)

On the Interplay between Social Welfare and Tractability of Equilibria
by: Anagnostides, Ioannis, et al.
Published: (2023)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
by: Anagnostides, Ioannis, et al.
Published: (2025)

Learning Potentials for Dynamic Matching and Application to Heart Transplantation
by: Zilberstein, Itai, et al.
Published: (2026)

Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
by: Zilberstein, Itai, et al.
Published: (2026)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
by: Anagnostides, Ioannis, et al.
Published: (2026)

The Complexity of Finding Local Optima in Contrastive Learning
by: Yan, Jingming, et al.
Published: (2025)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
by: Zhang, Brian Hu, et al.
Published: (2025)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Decision Making under Imperfect Recall: Algorithms and Benchmarks
by: Tewolde, Emanuel, et al.
Published: (2026)

Expected Variational Inequalities
by: Zhang, Brian Hu, et al.
Published: (2025)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2024)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
by: Kalogiannis, Fivos, et al.
Published: (2024)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
by: Barakat, Anas, et al.
Published: (2026)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
by: Leonardos, Stefanos, et al.
Published: (2021)

The Complexity of Equilibrium Refinements in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

The Value of Recall in Extensive-Form Games
by: Berker, Ratip Emin, et al.
Published: (2024)

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
by: Feng, Yi, et al.
Published: (2024)

Swap Regret Minimization Through Response-Based Approachability
by: Anagnostides, Ioannis, et al.
Published: (2026)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

ApproxED: Approximate exploitability descent via learned best responses
by: Martin, Carlos, et al.
Published: (2023)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

Performative Prediction with Neural Networks
by: Mofakhami, Mehrnaz, et al.
Published: (2023)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
by: Zhang, Brian, et al.
Published: (2022)

The Bayesian Context Trees State Space Model for time series modelling and forecasting
by: Papageorgiou, Ioannis, et al.
Published: (2023)