The second player's strategy in a linear differential game
A linear antagonistic two-person differential game with fixed instant of termination and convex pay-off function is considered. A numerical method is described for constructing the second (maximizing) player's strategy, which guarantees a close-to-optimal result. A computer-checked example is given.
linear antagonistic two-person differential game
scientific article; zbMATH DE number 4068663
scientific article