Construction of a compromise set of strategies in one linear differential game of three persons

The article provides a model example illustrating the algorithm of constructing a compromise set of strategies in a linear differential game of three persons with substantially more difficult dynamics than "simple motion". The efficiency of this algorithm for the case under examination is demonstrated.