On intrinsic complexity of Nash equilibrium problems and bilevel optimization
DOI10.1007/S10957-012-0210-7zbMATH Open1295.91007OpenAlexW2024014345MaRDI QIDQ2442702FDOQ2442702
Authors: Hubertus T. Jongen, Dominik Dorsch, Vladimir Shikhman 
Publication date: 1 April 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0210-7
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
bilevel optimizationsingularitiesgeneralized Nash equilibrium problemparametric optimizationbilevel feasible set
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Noncooperative games (91A10) General equilibrium theory (91B50)
Cites Work
- Generalized Nash equilibrium problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Practical bilevel optimization. Algorithms and applications
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Differential Topology
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Mathematical Programs with Equilibrium Constraints
- Generalized Nash equilibrium problems and Newton methods
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- Bilevel optimization: on the structure of the feasible set
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computation of relaxed pessimistic solutions to MPECs
- Nonconvex games with side constraints
- Critical sets in parametric optimization
- Title not available (Why is that?)
- The structured jet transversality theorem†
- On regular minimax optimization
- On Reducibility in Bilevel Problems
Cited In (10)
- Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach
- Equilibrium strategies for multiple interdictors on a common network
- Generic property of the partial calmness condition for bilevel programming problems
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- A bridge between bilevel programs and Nash games
- A cutting plane approach for solving linear bilevel programming problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- 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
- Improved error bound and a hybrid method for generalized Nash equilibrium problems
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)
