Expected Variational Inequalities
Brian Hu Zhang, Ioannis Anagnostides, Emanuel Tewolde, Ratip Emin Berker, Gabriele Farina, Vincent Conitzer, Tuomas Sandholm
Abstract
Variational inequalities (VIs) encompass many fundamental problems in diverse areas ranging from engineering to economics and machine learning. However, their considerable expressivity comes at the cost of computational intractability. In this paper, we introduce and analyze a natural relaxation-which we refer to as expected variational inequalities (EVIs)-where the goal is to find a distribution that satisfies the VI constraint in expectation. By adapting recent techniques from game theory, we show that, unlike VIs, EVIs can be solved in polynomial time under general (nonmonotone) operators. EVIs capture the seminal notion of correlated equilibria, but enjoy a greater reach beyond games. We also employ our framework to capture and generalize several existing disparate results, including from settings such as smooth games, and games with coupled constraints or nonconcave utilities.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6a88e11a-0148-402c-a9c5-a4e83ed4c99fCited by top-tier papers3
- Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and GamesYang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei et al.STOC 2026 · 5 citations
- On the Computational Complexity of Performative PredictionIoannis Anagnostides, Rohan Chauhan, Ioannis Panageas, Tuomas Sandholm et al.ICML 2026 · 1 citation
- On Tractable Φ-Equilibria in Non-Concave GamesYang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei et al.NeurIPS 2024
Builds on25
- Fast Extra Gradient Methods for Smooth Structured Nonconvex-Nonconcave Minimax ProblemsSucheol Lee, Donghwan KimNeurIPS 2021 · 125 citations
- Complexity of Finding Stationary Points of Nonconvex Nonsmooth FunctionsJingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra et al.ICML 2020 · 98 citations
- A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensionsDamek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan et al.NeurIPS 2022 · 77 citations
- Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problemsThomas Pethick, Puya Latafat, Panos Patrinos, Olivier Fercoq et al.ICLR 2022 · 60 citations
- A mean-field analysis of two-player zero-sum gamesCarles Domingo-Enrich, Samy Jelassi, Arthur Mensch, Grant M. Rotskoff et al.NeurIPS 2020 · 56 citations
Related papers
- Exploitability Minimization in Games and BeyondDenizalp Goktas, Amy GreenwaldNeurIPS 2022 · 15 citations
- Constrained Phi-EquilibriaMartino Bernasconi, Matteo Castiglioni, Alberto Marchesi, Francesco Trovò et al.ICML 2023
- On the Outcome Equivalence of Extensive-Form and Behavioral Correlated EquilibriaBrian Hu Zhang, Tuomas SandholmAAAI 2024
- Generalized Smooth Variational Inequalities: Methods with Adaptive StepsizesDaniil Vankov, Angelia Nedich, Lalitha SankarICML 2024 · 4 citations
- Optimal Algorithms for Decentralized Stochastic Variational InequalitiesDmitry Kovalev, Aleksandr Beznosikov, Abdurakhmon Sadiev, Michael Persiianov et al.NeurIPS 2022 · 41 citations
