Two-person nonzero-sum games and quadratic programming (Q2394092)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-person nonzero-sum games and quadratic programming |
scientific article; zbMATH DE number 3205835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-person nonzero-sum games and quadratic programming |
scientific article; zbMATH DE number 3205835 |
Statements
Two-person nonzero-sum games and quadratic programming (English)
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
0.8369407653808594
0 references
0.8317503333091736
0 references
0.8307767510414124
0 references
0.8275488615036011
0 references
