Partially-shared pessimistic bilevel multi-follower programming: concept, algorithm, and application

Solving multi objective linear Bilevel multi follower programming problem

Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria

We study the problem of computing an equilibrium in leader-follower games with a single leader and multiple followers where, after the leader’s commitment to a mixed strategy, the followers play simultaneously in a noncooperative way, reaching a Nash equilibrium. We tackle the problem from a bilevel programming perspective. Since, given the leader’s strategy, the followers’ subgame may admit mu...

solving multi objective linear bilevel multi follower programming problem

Solving Multi-objective Linear Bilevel Multi-follower Programming Problem

———————————————————————————————Abstract In sciences and industries such as signal optimization, traffic assignment, economic market and etc, many problems have been modeled by bilevel programming (BLP) problems, where in each level one must optimize some objective functions. There are so many algorithms in order to find the global optimum of the linear version of BLP problems. This paper addres...

Necessary Optimality Conditions in Pessimistic Bilevel Programming Necessary Optimality Conditions in Pessimistic Bilevel Programming

This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...