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 multiple Nash equilibria, we consider the cases where the followers play either the best (optimistic) or the worst (pessimistic) Nash equilibrium in terms of the leader's utility. For the optimistic case, we propose three formulations which cast the problem into a single level mixedinteger nonconvex program. For the pessimistic case, which, as we show, may admit a supremum but not a maximum, we develop an ad hoc branch-and-bound algorithm. Computational results are reported and illustrated