Abstract

Generalized Nash Equilibrium problem is widely applied 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.

This work is licensed under a Creative Commons Attribution 4.0 License.