Nash and Stackelberg Solutions Numerical Construction in a Two-Person Nonantagonistic Linear Positional Differential Game

The paper suggests numerical methods for constructing Nash and Stackelberg solutions in a linear two-person positional differential game with terminal payoffs of players and polygonal constraints for players controls. Formalization of players' strategies in the game is based on formalization and the results of positional antagonistic differential games positional antagonistic differential games theory, developed by N. N. Krasovskii and his scientific school. The game is such, that it could be reduced to a game on the plane and the problem is transformed to solving non-standard optimal control problems. For the approximation of trajectories in these problems a set of computational geometry algorithms in plane is used, including convex hull construction, union and intersection of polygons and a Minkowski sum for polygons.