Abstract
We consider a two-level optimization problem corresponding to a Stackelberg game in which the response function of the follower is multivalued and some convexity assumption on the data is missing. Different notions of ɛ-mixed strategies are introduced and sufficient conditions on the data for existence and convergence of the corresponding average values, as ɛ converges to 0, are given together with several examples.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
