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. For the case of a zero-sum game, the quadratic programming problem degenerates to the well-known dual linear programs associated with the game.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
