On the Infiltration Game

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.

MoreLess

Year of publication:	1998-05-19
Authors:	Goutal, P. ; Garnaev, A. ; Garnaeva, G.
Published in:	International Journal of Game Theory. - Springer. - Vol. 26.1997, 2, p. 215-221
Publisher:	Springer

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

More details

Type of publication:	Article
Notes:	Received December 1992 Revised version September 1995
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005155677