We present a new way to solve generalized Nash equilibrium problems. We assume the feasible set to be compact. Furthermore all functions are assumed to be polynomials. However we do not impose convexity on either the utility functions or the action sets. The key idea is to use Putinar’s...

We present a new way to solve generalized Nash equilibrium problems. We assume the feasible set to be compact. Furthermore all functions are assumed to be polynomials. However we do not impose convexity on either the utility functions or the action sets. The key idea is to use Putinar’s...

In this paper we consider the problem of the algorithmic parametrization of a d-dimensional semialgebraic subset S of Rn (n d) by a semialgebraic and continuous mapping from a subset of Rd. Using the Cylindrical Algebraic Decomposition algorithm we easily obtain semialgebraic, bijective...