Search for an infiltrator

Search for an infiltrator

0.00 Avg rating—0 Votes
Article ID: iaor19951407
Country: United States
Volume: 42
Issue: 1
Start Page Number: 15
End Page Number: 26
Publication Date: Feb 1995
Journal: Naval Research Logistics
Authors:
Keywords: search
Abstract:

A discrete search game on an array of n ordered cells for n•9, with two players: infiltrator (hider) and searcher, who have opposite goals, has been solved. The infiltrator wishes to reach the last cell number n (in finite time) and the searcher has to defend that cell. The payoff (to the hider) is the probability that the hider wins, that is, reaches the last cell without getting captured.

Reviews

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