Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Anagnostides, Ioannis, Farina, Gabriele, Sandholm, Tuomas, Zhang, Brian Hu
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Computer Science and Game Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Expected Variational Inequalities
par: Zhang, Brian Hu, et autres
Publié: (2025)

Convergence of Regret Matching in Potential Games and Constrained Optimization
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
par: Zhang, Brian Hu, et autres
Publié: (2025)

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

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
par: Zhang, Brian Hu, et autres
Publié: (2024)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
par: Anagnostides, Ioannis, et autres
Publié: (2024)

Barriers to Welfare Maximization with No-Regret Learning
par: Anagnostides, Ioannis, et autres
Publié: (2024)

Learning and Computation of $Φ$-Equilibria at the Frontier of Tractability
par: Zhang, Brian Hu, et autres
Publié: (2025)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
par: Soleymani, Ashkan, et autres
Publié: (2025)

On the Interplay between Social Welfare and Tractability of Equilibria
par: Anagnostides, Ioannis, et autres
Publié: (2023)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
par: Zhang, Brian, et autres
Publié: (2022)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
par: Soleymani, Ashkan, et autres
Publié: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
par: Cai, Yang, et autres
Publié: (2024)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
par: Anagnostides, Ioannis, et autres
Publié: (2026)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
par: Emmanouilidis, Konstantinos, et autres
Publié: (2024)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games
par: Zhang, Brian Hu, et autres
Publié: (2023)

Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
par: Anagnostides, Ioannis, et autres
Publié: (2026)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
par: Cai, Yang, et autres
Publié: (2025)

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization
par: Zhang, Brian Hu, et autres
Publié: (2022)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
par: Anagnostides, Ioannis, et autres
Publié: (2026)

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions
par: Prasad, Siddharth, et autres
Publié: (2025)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
par: Anagnostides, Ioannis, et autres
Publié: (2025)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
par: Cai, Yang, et autres
Publié: (2024)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
par: Zhang, Brian Hu, et autres
Publié: (2026)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
par: Simchi-Levi, David, et autres
Publié: (2019)

Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities
par: Beznosikov, Aleksandr, et autres
Publié: (2023)

Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
par: Zhang, Brian Hu, et autres
Publié: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
par: Hu, Ruimeng, et autres
Publié: (2025)

Convergence of Extragradient SVRG for Variational Inequalities: Error Bounds and Increasing Iterate Averaging
par: Nan, Tianlong, et autres
Publié: (2023)

A Variational Inequality Approach to Independent Learning in Static Mean-Field Games
par: Yardim, Batuhan, et autres
Publié: (2025)

Target Mirror Descent: A Unifying Framework for Solving Monotone Variational Inequalities
par: Chen, Yu-Wen, et autres
Publié: (2026)

The Complexity of Equilibrium Refinements in Potential Games
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
par: Ba, Wenjia, et autres
Publié: (2021)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
par: Ding, Shihong, et autres
Publié: (2023)

Hidden-Role Games: Equilibrium Concepts and Computation
par: Carminati, Luca, et autres
Publié: (2023)

A Lower Bound on Swap Regret in Extensive-Form Games
par: Daskalakis, Constantinos, et autres
Publié: (2024)

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
par: Carvalho, Margarida, et autres
Publié: (2021)

Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
par: Zhou, Fuzhong, et autres
Publié: (2024)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
par: Heymann, Benjamin, et autres
Publié: (2024)