Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization
From MaRDI portal
Publication:5014627
DOI10.1007/978-3-030-52119-6_4zbMath1479.91064OpenAlexW2980950815MaRDI QIDQ5014627
Jacqueline Morgan, M. Beatrice Lignola, Francesco Caruso
Publication date: 8 December 2021
Published in: Bilevel Optimization (Search for Journal in Brave)
Full work available at URL: http://www.csef.it/WP/wp541.pdf
bilevel optimization problemapproximate solutionTikhonov regularizationproximal point methodStackelberg gameinner regularization and viscosity solutionsubgame perfect Nash equilibrium problem
Hierarchical games (including Stackelberg games) (91A65) Semi-infinite programming (90C34) Multistage and repeated games (91A20)
Related Items
Entropic regularization in hierarchical games, Combining approximation and exact penalty in hierarchical programming, Existence of Solutions for Deterministic Bilevel Games under a General Bayesian Approach, On the computation of equilibria in monotone and potential stochastic hierarchical games, Oligopolistic markets with leadership, cooperative followers and a multivalued inverse demand function
Cites Work
- A method to bypass the lack of solutions in minsup problems under quasi-equilibrium constraints
- Solving ill-posed bilevel programs
- Asymptotic behavior of semi-quasivariational optimistic bilevel problems in Banach spaces
- Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting
- Stackelberg differential games in economic models
- Approximations and well-posedness in multicriteria games
- Multiobjective bilevel optimization
- Sequential Stackelberg equilibria in two-person games
- A theoretical approximation scheme for Stackelberg problems
- On generalized Stackelberg strategies
- Descent approaches for quadratic bilevel programming
- Stability of regularized bilevel programming problems
- Lower semicontinuity for approximate social Nash equilibria
- A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions
- Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution
- A partial cooperation model for non-unique linear two-level decision problems
- Foundations of bilevel programming
- Computing the strong Nash equilibrium for Markov chains games
- Equilibrium selection in multi-leader-follower games with vertical information
- Further on inner regularizations in bilevel optimization
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Oligopolistic markets with leadership and demand functions possibly discontinuous
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- Weak via strong Stackelberg problem: New results
- Topological existence and stability for Stackelberg problems
- Approximate values for mathematical programs with variational inequality constraints
- Numerically tractable optimistic bilevel problems
- An oracle based method to compute a coupled equilibrium in a model of international climate policy
- Subgame perfect Nash equilibrium: a learning approach via costs to move
- Strategic uncertainty and equilibrium selection in discontinuous games
- Semivectorial bilevel optimization problem: penalty approach
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems
- \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints
- On solving simple bilevel programs with a nonconvex lower level program
- Well-posedness and \(L\)-well-posedness for quasivariational inequalities
- On the Stackelberg strategy in nonzero-sum games
- A note on the Pareto optimality of solutions to the linear bilevel programming problem
- A sequential stability result for constrained Stackelberg problems
- Lower convergence of approximate solutions to vector quasi-variational problems
- Existence, Uniqueness, and Computation of Robust Nash Equilibria in a Class of Multi-Leader-Follower Games
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On the numerical solution of a class of Stackelberg problems
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- An Algorithm for Solving the General Bilevel Programming Problem
- A simple algorithm for the-linear bilevel programming problem
- Existence theorems of equilibrium points in stackelberg
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- Approximation of two-person games with information exchange
- Monotone Operators and the Proximal Point Algorithm
- The solution of a class of non-antagonistic games
- semi-continuities of marginal functions in a sequential setting
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs
- New results on approximate solution in two-level optimization
- Optimality conditions for bilevel programming problems
- Necessary Conditions for Bilevel Dynamic Optimization Problems
- Semivectorial Bilevel Convex Optimal Control Problems: Existence Results
- Distributed Computation of Equilibria in Monotone Nash Games via Iterative Regularization Techniques
- Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming
- The Standard Pessimistic Bilevel Problem
- Nash equilibrium in a pay-as-bid electricity market: Part 1 – existence and characterization
- Nash equilibrium in a pay-as-bid electricity market Part 2 - best response of a producer
- Game Theory
- Proximité et dualité dans un espace hilbertien
- Stackelburg solution for two-person games with biased information patterns
- On the convergence of stationary sequences in topology optimization
- A First Order Method for Solving Convex Bilevel Optimization Problems
- Equilibrium points in n -person games
- An inertial extrapolation method for convex simple bilevel optimization
- Mathematical Programs with Equilibrium Constraints
- Set-valued analysis
- Existence of solutions to two-level optimization problems with nonunique lower-level solutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
