Nash Equilibrium Problems of Polynomials: For Generic Polynomial Data the KKT-Cut Algorithm Terminates Finitely, Finding a Nash Equilibrium or Certifying That None ExistsResearch Paper
A Nash equilibrium problem (NEP) asks for strategies of several players such that no player can lower its own cost by deviating while the others keep theirs fixed. NEPs model competition in electricity markets, environmental agreements, and the training of generative adversarial networks. When the players' problems are nonconvex, an equilibrium requires…