Goutal, P.; Garnaev, A.; Garnaeva, G. - In: International Journal of Game Theory 26 (1997) 2, pp. 215-221
An infiltrator tries to go through a graph of n arcs, within a time limit, without being caught by a guard. The latter is allowed a restricted number of tentatives to catch the infiltrator. This paper describes optimal strategies and gives the value of this discrete zero-sum infiltration game.