Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets (Q471019)
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: Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets |
scientific article; zbMATH DE number 6369327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets |
scientific article; zbMATH DE number 6369327 |
Statements
Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets (English)
0 references
13 November 2014
0 references
The author considers an \(n\)-person game in which every player minimizes his quadratic cost function without violating certain linear constraint function. For the one-dimensional strategy set of each player an algorithm is provided that computes all solutions and terminates finitely. The effectiveness of the algorithm is shown for various examples.
0 references
one-dimensional strategy set
0 references
affine generalized Nash equilibrium problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8702381253242493
0 references
0.8030143976211548
0 references
0.7970735430717468
0 references
0.7956828474998474
0 references
