Polymatrix Games with Joint Constraints

Given an n-person game with quadratic type objectives and joint linear constraints, it is demonstrated that Lemke’s algorithm can be used to compute a Nash equilibrium.