Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets

We consider a class of generalized Nash equilibrium problems with quadratic cost functions and common linear constraints for all players. Further we focus on the case where every player has a single strategy variable within a bounded set. For this problem class we present an algorithm that is able to compute all solutions and that terminates finitely. Our method is based on a representation of the solution set as a finite union of polyhedral sets using sign conditions for the derivatives of the cost and constraint functions. The effectiveness of the algorithm is shown in various examples from literature.