广义Nash均衡问题的双层规划等价形式

Generalized Nash Equilibrium problem is widely used but hard to solve. In this paper, we transform the generalized 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.