Abstract
Dynamic games arise when multiple agents with differing objectives choose control inputs to a dynamic system. However, compared to single-agent control problems, the computational methods for dynamic games are relatively limited. Only very specialized dynamic games can be solved exactly, so approximation algorithms are required. In this paper, we show how to extend a recursive Newton algorithm and differential dynamic programming (DDP) to the case of full-information non-zero sum dynamic games. We show that the iterates of Newton's method and DDP are sufficiently close for DDP to inherit the quadratic convergence rate of Newton's method.
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.
