Computation of equilibrium points of delayed partial information pursuit evasion games

Motivated by the "Hunter and rabbit" game [1], we study a class of discrete time, discrete state games with partial information, for which we show that the calculation of the saddlepoint at each step of the dynamic programming algorithm decouples into two trivial finite optimization problems, thus avoiding a simplex at each step of a large number of fixed point problems.