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.
|Title of host publication||Search Theory|
|Subtitle of host publication||A Game Theoretic Perspective|
|Publisher||Springer New York|
|Number of pages||13|
|ISBN (Print)||1461468248, 9781461468240|
|State||Published - 1 Jul 2013|
Bibliographical notePublisher Copyright:
© 2013 Springer Science+Business Media New York. All rights are reserved.
ASJC Scopus subject areas
- Computer Science (all)
- Mathematics (all)