A theoretical approximation scheme for Stackelberg problems

DOI10.1007/BF00940846zbMATH Open0642.90107OpenAlexW2039165878MaRDI QIDQ1101360FDOQ1101360

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4006030
• On the numerical solution of a class of Stackelberg problems
• Weak via strong Stackelberg problem: New results
• Existence and approximation results involving regularized constrained Stackelberg problems
• New approach to linear Stackelberg problems with multiple leaders-follower

zbMATH Keywords

hierarchical programmingStackelberg problemasymptotically 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)

Cites Work

• Title not available (Why is that?)
• Dynamic noncooperative game theory
• Title not available (Why is that?)
• Stackelburg solution for two-person games with biased information patterns
• Title not available (Why is that?)
• Tangency and differentiation: Some applications of convergence theory
• A new computational method for Stackelberg and min-max problems by use of a penalty method

Cited In (33)

• Bilevel Nash equilibrium problems: numerical approximation via direct-search methods
• Title not available (Why is that?)
• Double penalty method for bilevel optimization problems
• Hierarchical problems of Nash points: Existence and approximation in the case of uniqueness of the solution to the lower level problem
• A new Nash optimization method based on alternate elitist information exchange for multi-objective aerodynamic shape design
• Asymptotic behavior of subgame perfect Nash equilibria in Stackelberg games
• On the numerical solution of a class of Stackelberg problems
• A partial cooperation model for non-unique linear two-level decision problems
• Topological existence and stability for min sup problems
• Bilevel and multilevel programming: A bibliography review
• Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems
• Weak via strong Stackelberg problem: New results
• Optimality conditions for semivectorial bilevel convex optimal control problems
• Necessary optimality conditions for Stackelberg problems
• Min-max and min-min Stackelberg strategies with closed-loop information structure
• Topological existence and stability for Stackelberg problems
• Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
• Approximate values for mathematical programs with variational inequality constraints
• Semivectorial bilevel optimization problem: penalty approach
• \(\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:
• Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case
• Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
• Equilibrium selection in multi-leader-follower games with vertical information
• Existence and approximation results involving regularized constrained Stackelberg problems
• Regularization and approximation methods in Stackelberg games and bilevel optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Interactions between bilevel optimization and Nash games
• Single/two-objective aerodynamic shape optimization by a Stackelberg/adjoint method
• Approximation algorithms for the generalized stacker crane problem
• Bilevel convex programming models
• Optimality conditions for bilevel programming problems
• Disjunctive cuts for continuous linear bilevel programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101360)