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 book 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Search Theory |
| Subtitle of host publication | A Game Theoretic Perspective |
| Publisher | Springer New York |
| Pages | 17-27 |
| Number of pages | 11 |
| Volume | 9781461468257 |
| ISBN (Electronic) | 9781461468257 |
| ISBN (Print) | 1461468248, 9781461468240 |
| DOIs | |
| State | Published - Jul 1 2013 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Mathematics(all)