On the infiltration game

0.00 Avg rating—0 Votes

Article ID:	iaor19982894
Country:	Germany
Volume:	26
Issue:	2
Start Page Number:	215
End Page Number:	221
Publication Date:	Jan 1997
Journal:	International Journal of Game Theory
Authors:	Garnaev A.Y., Garnaeva G., Goutal P.
Keywords:	search

Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.