Existence of a nash equilibrium to differential games with nonlinear constraints

The above theorm states that much larger classes of differential games have an equilibrium. The most severe assumption is the second one. It requires that state dynamic equations be linear on his own control variables. But, the dynamic programming approach applied in the above is hardly implementable for the purpose of computation. It is very difficult to solve (SP$_{it}$) directly. Notice, however, the problem can be transformed into a Hamiltonian maximization problem which is easy to solve if initial conditions are given. In this way, it is possible to design a solution algorithm to problems with nonlinear constraints. The above two theorems probide a basis for such an algorithm.m.