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 need any convexity assumptions on either the utility functions or the action sets. The key idea is to use...

We consider discrete-time dynamic principal-agent problems with continuous choice sets and potentially multiple agents. We prove the existence of a unique solution for the principal's value function only assuming continuity of the functions and compactness of the choice sets. We do this by a...

We consider discrete‐time dynamic principal–agent problems with continuous choice sets and potentially multiple agents. We prove the existence of a unique solution for the principal's value function only assuming continuity of the functions and compactness of the choice sets. We do this by a...

Static and dynamic games are important tools for the analysis of strategic interactions among economic agents and have found many applications in economics. In many games equilibria can be described as solutions of polynomial equations. In this paper we describe state-of-the-art techniques for...