On intrinsic complexity of Nash equilibrium problems and bilevel optimization
From MaRDI portal
Publication:2442702
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.
Recommendations
- Interactions between bilevel optimization and Nash games
- Generalized Nash equilibrium problems, bilevel programming and MPEC. Based on lectures given at the international center for pure and applied mathematics (CIMPA) school, Delhi, India, November 25 -- December 6, 2013
- On Reducibility in Bilevel Problems
- A bridge between bilevel programs and Nash games
- On Stackelberg-Nash equilibria in bilevel optimization games
Cites work
- Bilevel optimization: on the structure of the feasible set
- Critical sets in parametric optimization
- Differential Topology
- Foundations of bilevel programming
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium problems and Newton methods
- scientific article; zbMATH DE number 3752608 (Why is no real title available?)
- scientific article; zbMATH DE number 597936 (Why is no real title available?)
- scientific article; zbMATH DE number 2119538 (Why is no real title available?)
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical Programs with Equilibrium Constraints
- Nonconvex games with side constraints
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On Reducibility in Bilevel Problems
- On regular minimax optimization
- On the computation of relaxed pessimistic solutions to MPECs
- Practical bilevel optimization. Algorithms and applications
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- The structured jet transversality theorem†
Cited in
(12)- A bridge between bilevel programs and Nash games
- Generalized Nash equilibrium problems, bilevel programming and MPEC. Based on lectures given at the international center for pure and applied mathematics (CIMPA) school, Delhi, India, November 25 -- December 6, 2013
- Equilibrium strategies for multiple interdictors on a common network
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Improved error bound and a hybrid method for generalized Nash equilibrium problems
- A cutting plane approach for solving linear bilevel programming problems
- Interactions between bilevel optimization and Nash games
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Generic property of the partial calmness condition for bilevel programming problems
- How stringent is the linear independence kink qualification in abs-smooth optimization?
- Algebraic degrees of generalized Nash equilibrium problems
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
This page was built for publication: On intrinsic complexity of Nash equilibrium problems and bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442702)
