The Standard Pessimistic Bilevel Problem
From MaRDI portal
Publication:5231679
DOI10.1137/18M119759XzbMath1427.90263MaRDI QIDQ5231679
Lorenzo Lampariello, Simone Sagratella, Oliver Stein
Publication date: 27 August 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
generalized Nash equilibrium problemmathematical program with complementarity constraintspessimistic bilevel programmingstandard optimistic bilevel problem
Noncooperative games (91A10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Other game-theoretic models (91A40)
Related Items
Combining approximation and exact penalty in hierarchical programming ⋮ Numerically tractable optimistic bilevel problems ⋮ A bilevel approach to ESG multi-portfolio selection ⋮ Convergences for robust bilevel polynomial programmes with applications ⋮ Equilibrium selection for multi-portfolio optimization ⋮ An explicit Tikhonov algorithm for nested variational inequalities ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Methods for Pessimistic Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On the solution of monotone nested variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving ill-posed bilevel programs
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- Partial penalization for the solution of generalized Nash equilibrium problems
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- Decomposition algorithms for generalized potential games
- \(\epsilon\)-mixed strategies for static continuous-kernel Stackelberg games
- Links between linear bilevel and mixed 0-1 programming problems
- Bi-level strategies in semi-infinite programming.
- Foundations of bilevel programming
- A bridge between bilevel programs and Nash games
- Algorithms for generalized potential games with mixed-integer variables
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Weak via strong Stackelberg problem: New results
- On generalized semi-infinite optimization and bilevel optimization
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- A solution approach to the weak linear bilevel programming problems
- Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
- An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- A regularization method for ill-posed bilevel optimization problems
- Existence theorems of equilibrium points in stackelberg
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- Variational Analysis
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- Necessary optimality conditions in pessimistic bilevel programming
- Pessimistic Bilevel Optimization
- Maximum entropy approach for solving pessimistic bilevel programming problems
- Point-to-Set Maps in Mathematical Programming
- Generalized Nash equilibrium problems
- Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
