Numerical construction of Stackelberg solutions in a linear positional differential game based on the method of polyhedra

We consider the problem of constructing approximate Stackelberg solutions in a linear non-zero-sum positional differential game of two players with terminal payoffs and player controls chosen on convex polyhedra. A formalization of player strategies and motions generated by them is based on the formalization and results of the theory of zero-sum positional differential games developed by N. N. Krasovskii and his scientific school. The problem of finding a Stackelberg solution reduces to solving nonstandard optimal control problems. We propose an approach based on operations with convex polyhedra.