Abstract
Stackelberg games, which was originally introduced by Stackelberg, are widely applied in such fields as economics, management, politics and behavioral sciences. Stackelberg games can be modelled as a bi-level optimization problem. There exists an extensive literature about static bi-level optimization problems. However, the studies on dynamic bi-level optimization problems are fairly scarce in spite of the importance in explaining and predicting some phenomena rationally. In this paper, we consider discrete time dynamic Stackelberg games with feedback information. In general, the lower-level strategies are non-unique in practice. For a unique solution, dynamic programming algorithms have been presented with multiple players. We revisit dynamic programming for feedback information dynamic Stackelberg games with non-unique lower-level solution. First, we define some kind of solutions related to the decisions styles. Then, we analyze them, respectively. Moreover, dynamic programming algorithm is successful in solving solve feedback information dynamic Stackelberg games with non-unique lower-level solutions.
Sign-in/Register to access full text options 
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.
