On discrete lower \(\pi\)-strategies (Q1098795)

Two-person zero-sum differential games of survival are investigated. It is assumed that player I, as well as player II, can employ during the course of the game any lower \(\pi\)-strategy, \(\pi (t_ i)\) being a finite partition of \([t_ 0,\infty)\). The concept of a discrete lower \(\pi\)-strategy is introduced and it is shown that if player I (II) confines himself to the space of discrete lower \(\pi\)-strategies, being a subset of the space of lower \(\pi\)-strategies, then he will be able to force the same lower (upper) value as if he could employ any lower \(\pi\)- strategy. Since we do not use any deep facts about differential games, the results containd here might be extended to continuous games.