A theoretical approximation scheme for Stackelberg problems

DOI10.1007/BF00940846zbMath0642.90107OpenAlexW2039165878MaRDI QIDQ1101360

Pierre Loridan, Jacqueline Morgan

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940846

zbMATH Keywords

Stackelberg problemhierarchical programmingasymptotically Stackelberg approximating sequenceslimits of setsperturbed constraintssequence of two-level optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) 2-person games (91A05) Hierarchical systems (93A13)

Related Items (24)

Optimality conditions for bilevel programming problems ⋮ Bilevel and multilevel programming: A bibliography review ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ Topological existence and stability for Stackelberg problems ⋮ Single/two-objective aerodynamic shape optimization by a Stackelberg/adjoint method ⋮ Approximate values for mathematical programs with variational inequality constraints ⋮ Hierarchical problems of Nash points: Existence and approximation in the case of uniqueness of the solution to the lower level problem ⋮ Equilibrium selection in multi-leader-follower games with vertical information ⋮ \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints ⋮ Weak stackelberg problem and mixed solutions under data perturbations¹¹this paper is based upon a communication presented at the 14th symposium on mathematical programming with data perturbation, Washington D.C. 1992. This research has been supported by M.U.R.S.T Roma, Italia.$ef: ⋮ Min-max and min-min Stackelberg strategies with closed-loop information structure ⋮ Double penalty method for bilevel optimization problems ⋮ Disjunctive cuts for continuous linear bilevel programming ⋮ Optimality Conditions for Semivectorial Bilevel Convex Optimal Control Problems ⋮ Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems ⋮ Topological existence and stability for min sup problems ⋮ A new Nash optimization method based on alternate elitist information exchange for multi-objective aerodynamic shape design ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Bilevel convex programming models ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A partial cooperation model for non-unique linear two-level decision problems ⋮ Necessary optimality conditions for Stackelberg problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tangency and differentiation: Some applications of convergence theory
• Dynamic noncooperative game theory
• A new computational method for Stackelberg and min-max problems by use of a penalty method
• Stackelburg solution for two-person games with biased information patterns

This page was built for publication: A theoretical approximation scheme for Stackelberg problems