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...

In this paper we look at a new way to combine both quantity precommitment and price competition in a dynamic games framework. In each period players choose to invest in production capacities for the next period and also engage in a price competition. Production is free up to capacity and has...

Multiplicity of equilibria is a common problem in many economic models. In general, it is impossible to devise methods that always find all equilibria for any type of model. A notable exception are models in which all equilibria are solutions to a system of polynomial equations since there are...

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...