Approximation of the Information Set in a Differential Search Game with a Team of Evaders

The zero-sum differential search game with prescribed duration is considered. The evader tries to minimize the probability of detection. Mixed strategies of the evader is determined using the auxiliary game with a detail of evaders. For the game with a detail of evaders we construct the information set for the position of the evaders and study properties and approximation problems of this information set.