2011 | OriginalPaper | Chapter
Sub- and Super-optimality Principles and Construction of Almost Optimal Strategies for Differential Games in Hilbert Spaces
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We prove sub- and superoptimality principles of dynamic programming and show how to use the theory of viscosity solutions to construct almost optimal strategies for two-player, zero-sum differential games driven by abstract evolution equations in Hilbert spaces.