A theoretical approximation scheme for Stackelberg problems

Review text

We consider the Stackelberg problem corresponding to a two-player game in which one of the two players has the leadership in playing the game. We present a general approach for approximating the considered hierarchical programming problem by a sequence of two-level optimization problems. From a practical point of view, we also give some results for asymptotically Stackelberg approximating sequences and for problems with perturbed constraints.

Recommendations

Cites work

Cited in

(36)

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