17 citations · 17 across the 9 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2026
A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
Ioannis Anagnostides, Gabriele Farina, Tuomas Sandholm +1
Solving (Stampacchia) variational inequalities (SVIs) is a foundational problem at the heart of optimization. However, this expressivity comes at the cost of computational hardness…
math.OC2024
Iteratively Regularized Gradient Tracking Methods for Optimal Equilibrium Seeking
Yuyang Qiu, Farzad Yousefian, Brian Zhang
In noncooperative Nash games, equilibria are often inefficient. This is exemplified by the Prisoner's Dilemma and was first provably shown in the 1980s. Since then, understanding t…