Abstract

We introduce a new, and elementary, approximation method for bilevel optimization problems motivated by Stackelberg leader-follower games. Our technique is based on the notion of two-scale Gibbs measures. The first scale corresponds to the cost function of the follower and the second scale to that of the leader. We explain how to choose the weights corresponding to these two scales under very general assumptions and establish rigorous Γ-convergence results. An advantage of our method is that it is applicable both to optimistic and to pessimistic bilevel problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call