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.
| Original language | English |
|---|---|
| Title of host publication | Wiley Encyclopedia of Operations Research and Management Science |
| Publisher | wiley |
| Pages | 1-8 |
| Number of pages | 8 |
| ISBN (Electronic) | 9780470400531 |
| ISBN (Print) | 9780470400630 |
| DOIs | |
| State | Published - 1 Jan 2010 |
Bibliographical note
Publisher Copyright:© 2010 John Wiley & Sons, Inc. All rights reserved.
Keywords
- Chinese postman tour
- cow path problem
- doubling
- linear search problem
- minimax trajectory
- optimal strategy
- princess and monster game
- search game
- star search
- swimming-in-a-fog problem
ASJC Scopus subject areas
- General Arts and Humanities
- General Business, Management and Accounting
Fingerprint
Dive into the research topics of 'Search Games'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver