Standard Article

Search Games

  1. Shmuel Gal

Published Online: 15 FEB 2011

DOI: 10.1002/9780470400531.eorms0912

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Gal, S. 2011. Search Games. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. University of Haifa, Department of Statistics, Haifa, Israel

Publication History

  1. Published Online: 15 FEB 2011

Abstract

This article surveys the area of search games with immobile and mobile hider. The search space is either a graph, a bounded domain 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. An overview is presented with emphasis on general results concerning minimax search trajectories and optimal search strategies.

Keywords:

  • search game;
  • minimax trajectory;
  • optimal strategy;
  • Chinese postman tour;
  • princess and monster game;
  • linear search problem;
  • doubling;
  • star search;
  • cow path problem;
  • swimming-in-a-fog problem