First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems

by   Michael I. Jordan, et al.

We consider the problem of computing an equilibrium in a class of nonlinear generalized Nash equilibrium problems (NGNEPs) in which the strategy sets for each player are defined by equality and inequality constraints that may depend on the choices of rival players. While the asymptotic global convergence and local convergence rate of solution procedures have been studied in this setting, the analysis of iteration complexity is still in its infancy. Our contribution is to provide two simple first-order algorithmic frameworks based on the quadratic penalty method and the augmented Lagrangian method, respectively, with an accelerated mirror-prox algorithm as the inner loop. We provide nonasymptotic theoretical guarantees for these algorithms. More specifically, we establish the global convergence rate of our algorithms for solving (strongly) monotone NGNEPs and we provide iteration complexity bounds expressed in terms of the number of gradient evaluations. Experimental results demonstrate the efficiency of our algorithms.


page 1

page 2

page 3

page 4


Doubly Optimal No-Regret Learning in Monotone Games

We consider online learning in multi-player smooth monotone games. Exist...

Equilibrium Computation of Generalized Nash Games: A New Lagrangian-Based Approach

This paper presents a new primal-dual method for computing an equilibriu...

On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging

We study the stochastic bilinear minimax optimization problem, presentin...

Matrix Exponential Learning for Resource Allocation with Low Informational Exchange

We consider a distributed resource allocation problem in a multicarrier ...

Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms

Wide machine learning tasks can be formulated as non-convex multi-player...

The Generalized Eigenvalue Problem as a Nash Equilibrium

The generalized eigenvalue problem (GEP) is a fundamental concept in num...

Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium

We consider the traffic assignment problem in nonatomic routing games wh...

Please sign up or login with your details

Forgot password? Click here to reset