Construction of the value function in a game of approach with several pursuers (Q1315580): Difference between revisions

The paper extends an approach presented earlier by other Russian authors. The game with ``simple motions'' starts at \(t= 0\) and ends at \(t= T\). The so-called programmed maximin function is proved to be \(n\)-stable. It coincides with the value function when \(t= T\). An example of a game with 3 pursuers and 1 evader is demonstrated in detail.