Information Technology Reference
In-Depth Information
Chapter 2
Search Games for an Immobile Hider
Thomas Lidbetter
Abstract
A search game for an immobile hider is a zero-sum game taking place
in some search space. The hider picks a point in the space and a searcher who is
unaware of the hider's location moves around attempting to find him in the least
possible time. We give an overview of the theory of search games on a network with
an immobile hider, starting with their conception in the Rufus Isaac's 1965 topic on
Differential Games, then moving on to some classic results in the field from Shmuel
Gal and others. Finally we discuss some recent work on new search game models
which consider, for example, what happens when the searcher does not have a fixed
starting point or when the speed of the searcher depends on the direction in which
he is traveling.
Search WWH ::
Custom Search