Abstract

Three different versions of a stochastic Stackelberg closedloop dynamic game are presented and solved. These three versions correspond to complete state information structure, one-step-delay sharing information structure, and controlsharing information structure. The essential difficulty of solving the problem comes from the fact that the information structure is non-nested from the leader's viewpoint. We show that these problems can be reduced to a single solvable generic problem.

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

Disclaimer: 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.