Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem

Generalized Nash Equilibrium problem is widely applied but hard to solve. In this paper, we transform the general-ized Nash game into a special bilevel programming with one leader and multi-followers by supposing a suppositional leader, that is an upper decision maker. The relations between their solutions are discussed. We also discuss the further simplification of the bilevel programming. Many conclusions and the further research are drawn at last