On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635)
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 solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game |
scientific article; zbMATH DE number 7495083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game |
scientific article; zbMATH DE number 7495083 |
Statements
On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (English)
0 references
22 March 2022
0 references
bilevel optimization
0 references
bilevel problems with a nonconvex lower level
0 references
optimistic solution
0 references
bimatrix game
0 references
Nash equilibrium
0 references
reduction theorem
0 references
problem with D.C. constraints
0 references
global search theory
0 references
exact penalization theory
0 references
local search
0 references
0 references
0 references
0 references
