Abstract
We are concerned with constrained Stackelberg problems, corresponding to nonzero-sum non-cooperative games, in which the constraints of the leader depend on the reaction set of the follower supposed not to be a singleton, generalizing the case considered in [2,10]. In [1], existence and approximation results have been given by considering regularized problems. Here our aim is to give stability results for such regularized problems under data perturbations, generalizing those presented in [9]
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
