Nash equilibrium problems of polynomials

DOI10.1287/MOOR.2022.0334MaRDI QIDQ6563026zbMATH OpenFDO

Authors Jiawang Nie, Xindong Tang

Publication date 27 June 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2022.0334

zbMATH Keywords

Lagrange multiplier expressionmoment-SOS relaxationNash equilibriumpolynomial optimizationtight relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polynomial optimization (90C23) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Noncooperative games (91A10)

Recommendations

• Convex generalized Nash equilibrium problems and polynomial optimization
• On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
• Combinatorial optimization in Nash games
• Finding all Nash equilibria of a finite game using polynomial algebra
• LATIN 2004: Theoretical Informatics

Cited in

(7)

• A branch-and-prune algorithm for discrete Nash equilibrium problems
• A branch-and-bound algorithm for nonconvex Nash equilibrium problems
• Polynomial optimization over unions of sets
• Algebraic degrees of generalized Nash equilibrium problems
• Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
• Generalized Nash equilibrium problems with quasi-linear constraints
• A unified relaxation method for tensor split feasibility problems on unions of sets

This page was built for publication: Nash equilibrium problems of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563026)