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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 19:28, 2 February 2024

scientific article
Language Label Description Also known as
English
Two-person nonzero-sum games and quadratic programming
scientific article

    Statements

    Two-person nonzero-sum games and quadratic programming (English)
    0 references
    0 references
    0 references
    1964
    0 references
    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.
    0 references
    operations research
    0 references

    Identifiers