Two-person nonzero-sum games and quadratic programming (Q2394092): Difference between revisions

From authors' abstract: It is shown that a necessary and sufficient condition that a point be a Nash equilibrium point of a two-person nonzero-sum game with a finite number of pure strategies is that the point be a solution of a single programming problem with linear constraints and a quadratic objective function that has a global maximum of zero. Every equilibrium point is a solution of this programming problem.