We consider the problem of solving a quadratic potential game with single quadratic constraints, under no monotonicity condition of the game, nor convexity in any of the player's problem. We show existence of Nash equilibria (NE) in the game, and propose a framework to calculate Pareto efficient solutions. Regarding the corresponding non-convex potential function, we show that strong duality holds with its corresponding dual problem, give existence results of solutions and present conditions for global optimality. Finally, we propose a centralized method to solve the potential problem, and a distributed version for compact constraints. We also present simulations showing convergence behavior of the proposed distributed algorithm.
['Javier Zazo', 'Santiago Zazo', 'Sergio Valcarcel Macua']
Non-monotone quadratic potential games with single quadratic constraints