By standard Nash equilibrium problem (NEP), I mean the Nash equilibrium problem as opposed to Generalized Nash equilibrium problem(GNEP). In standard Nash equilibrium problem, constraint is independent of the other players’ strategies. It seems that a lot of numerical algorithms are designed for GNEP. But if it is NEP with linear constraints, are there any particular algorithms designed that is simpler than GNEP?

Appreciate any kind of help in advance!

More Mingzhu Yao's questions See All
Similar questions and discussions