Rational Generalized Nash Equilibrium Problems
Jiawang Nie, Xindong Tang, Suhan Zhong

TL;DR
This paper introduces a novel hierarchy of rational optimization problems and applies Moment-SOS relaxations to compute or detect the nonexistence of generalized Nash equilibria in non-convex rational function settings.
Contribution
It develops a new approach using rational expressions and Moment-SOS relaxations to analyze and compute GNE in non-convex rational problems, extending existing methods.
Findings
Hierarchy can compute GNE if it exists
Method can detect nonexistence of GNE
Numerical experiments demonstrate efficiency
Abstract
This paper studies generalized Nash equilibrium problems that are given by rational functions. The optimization problems are not assumed to be convex. Rational expressions for Lagrange multipliers and feasible extensions of KKT points are introduced to compute a generalized Nash equilibrium (GNE). We give a hierarchy of rational optimization problems to solve rational generalized Nash equilibrium problems. The existence and computation of feasible extensions are studied. The Moment-SOS relaxations are applied to solve the rational optimization problems. Under some general assumptions, we show that the proposed hierarchy can compute a GNE if it exists or detect its nonexistence. Numerical experiments are given to show the efficiency of the proposed method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Optimization and Variational Analysis · Matrix Theory and Algorithms
