LAUSR

A generalised Nash game is a non-cooperative game in which each player is facing an optimisation problem where both the objective function and the feasible set depend on the variables of the other players. A classical way to treat numerically this difficult problem is to solve the nonlinear system composed of the concatenation of the Karush–Kuhn–Tucker optimality conditions of each player’s problem. The aim of this work is to provide constraint qualification conditions ensuring that both problems share the same set of solutions. Our main target here is to elaborate tractable conditions, that is, sets of conditions that are as simple as possible to fulfil. This is achieved through the analysis of “minimal” qualification conditions for parametric optimisation problems.