Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria
From MaRDI portal
Publication:4580191
Recommendations
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
- Solving multi-leader-common-follower games
- Existence, uniqueness, and computation of robust Nash equilibria in a class of multi-leader-follower games
- Bilevel programs with multiple followers.
Cited in
(10)- Leadership in singleton congestion games: what is hard and what is easy
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Single-Leader-Radner-equilibrium: a new approach for a class of bilevel problems under uncertainty
- A unified framework for multistage mixed integer linear optimization
- Some remarks about existence of equilibria, and the validity of the EPCC reformulation for multi-leader-follower games
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- Bilevel direct search method for leader-follower problems and application in health insurance
- Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application
- Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
This page was built for publication: Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580191)
