On intrinsic complexity of Nash equilibrium problems and bilevel optimization (Q2442702)
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: On intrinsic complexity of Nash equilibrium problems and bilevel optimization |
scientific article; zbMATH DE number 6276392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On intrinsic complexity of Nash equilibrium problems and bilevel optimization |
scientific article; zbMATH DE number 6276392 |
Statements
On intrinsic complexity of Nash equilibrium problems and bilevel optimization (English)
0 references
1 April 2014
0 references
The authors study both generalized Nash equilibrium problems and bilevel optimization problems. They focus on structural analysis of geometric phenomena which originate from unavoidable degeneracies occuring in generic parametric optimization and singularity theory. In particular, for generalized Nash equilibrium problems the number of players common constraints is essential. For bilevel problems, the global structure of the feasible set in case of a one-dimensional leader's variable is described.
0 references
generalized Nash equilibrium problem
0 references
bilevel optimization
0 references
parametric optimization
0 references
singularities
0 references
bilevel feasible set
0 references
0 references
0 references
0 references
0.8100190162658691
0 references
0.7829115986824036
0 references
0.7827658653259277
0 references
0.769676685333252
0 references
0.7682468295097351
0 references
