Search games: A review

Shmuel Gal

doi:10.1007/978-1-4614-6825-7_1

Search games: A review

Shmuel Gal

Department of Statistics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-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 language	English
Title of host publication	Search Theory
Subtitle of host publication	A Game Theoretic Perspective
Publisher	Springer New York
Pages	3-15
Number of pages	13
Volume	9781461468257
ISBN (Electronic)	9781461468257
ISBN (Print)	1461468248, 9781461468240
DOIs	https://doi.org/10.1007/978-1-4614-6825-7_1
State	Published - 1 Jul 2013

Bibliographical note

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

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1007/978-1-4614-6825-7_1

Cite this

@inbook{b36a615668b9478cbf8237d1df156d8a,

title = "Search games: A 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.",

author = "Shmuel Gal",

note = "Publisher Copyright: {\textcopyright} 2013 Springer Science+Business Media New York. All rights are reserved.",

year = "2013",

month = jul,

day = "1",

doi = "10.1007/978-1-4614-6825-7_1",

language = "English",

isbn = "1461468248",

volume = "9781461468257",

pages = "3--15",

booktitle = "Search Theory",

publisher = "Springer New York",

address = "United States",

}

TY - CHAP

T1 - Search games

T2 - A review

AU - Gal, Shmuel

PY - 2013/7/1

Y1 - 2013/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84929561056&partnerID=8YFLogxK

U2 - 10.1007/978-1-4614-6825-7_1

DO - 10.1007/978-1-4614-6825-7_1

M3 - Chapter

AN - SCOPUS:84929561056

SN - 1461468248

SN - 9781461468240

VL - 9781461468257

SP - 3

EP - 15

BT - Search Theory

PB - Springer New York

ER -

Search games: A review

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this