scholarly journals Learning Generalized Nash Equilibria in a Class of Convex Games

2019 ◽  
Vol 64 (4) ◽  
pp. 1426-1439 ◽  
Author(s):  
Tatiana Tatarenko ◽  
Maryam Kamgarpour
2013 ◽  
Vol 23 (1) ◽  
pp. 452-474 ◽  
Author(s):  
D. Dorsch ◽  
H. Th. Jongen ◽  
V. Shikhman

2014 ◽  
Vol 236 (1) ◽  
pp. 326-339 ◽  
Author(s):  
Jonatha Anselmi ◽  
Danilo Ardagna ◽  
Mauro Passacantando

Author(s):  
Jiawang Nie ◽  
Xindong Tang

AbstractThis paper studies convex generalized Nash equilibrium problems that are given by polynomials. We use rational and parametric expressions for Lagrange multipliers to formulate efficient polynomial optimization for computing generalized Nash equilibria (GNEs). The Moment-SOS hierarchy of semidefinite relaxations are used to solve the polynomial optimization. Under some general assumptions, we prove the method can find a GNE if there exists one, or detect nonexistence of GNEs. Numerical experiments are presented to show the efficiency of the method.


Sign in / Sign up

Export Citation Format

Share Document