Search games for an immobile hider

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations

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 languageEnglish (US)
Title of host publicationSearch Theory
Subtitle of host publicationA Game Theoretic Perspective
PublisherSpringer New York
Pages17-27
Number of pages11
Volume9781461468257
ISBN (Electronic)9781461468257
ISBN (Print)1461468248, 9781461468240
DOIs
StatePublished - Jul 1 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Search games for an immobile hider'. Together they form a unique fingerprint.

Cite this