On intrinsic complexity of Nash equilibrium problems and bilevel optimization (Q2442702)

From MaRDI portal
Revision as of 20:16, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
On intrinsic complexity of Nash equilibrium problems and bilevel optimization
scientific article

    Statements

    On intrinsic complexity of Nash equilibrium problems and bilevel optimization (English)
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references