Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem

Lianju Sun

Abstract

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

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.