Title:  Generalized Nash games - computing solutions

We present a brief introduction to generalized Nash games. These are Nash games where the players' strategy sets vary with the choice of strategy. Among the generic formulation of this class, we distinguish the GN games with shared constraints. Allowing for shared constraints satisfied by all players simplifies to some degree the complexity of solving a GN. We present in this talk a solution method for solving GN with shared constraints, challenges in the current research on the topic and models where this class of games arises naturally.