Search games: A review

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

This review presents an update on the area of Search Games, highlighting recent developments in the field, as well as presenting some new problems for further research. The search space is either a graph, a bounded domain, a mixture of the above, or an unbounded set. The search process is presented as a two-player zero-sum game between the searcher and the hider. The searcher moves along a continuous trajectory and the cost function is the time needed to find the hider. Our review emphasises general results concerning minimax search trajectories and optimal search strategies.

Original languageEnglish
Title of host publicationSearch Theory
Subtitle of host publicationA Game Theoretic Perspective
PublisherSpringer New York
Pages3-15
Number of pages13
Volume9781461468257
ISBN (Electronic)9781461468257
ISBN (Print)1461468248, 9781461468240
DOIs
StatePublished - 1 Jul 2013

Bibliographical note

Publisher Copyright:
© 2013 Springer Science+Business Media New York. All rights are reserved.

ASJC Scopus subject areas

  • Computer Science (all)
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Search games: A review'. Together they form a unique fingerprint.

Cite this