Search Games

Alan Washburn
Additional contact information
Alan Washburn: Naval Postgraduate School

Chapter Chapter 8 in Two-Person Zero-Sum Games, 2014, pp 143-158 from Springer

Abstract: Abstract In this chapter we consider searching for objects that don’t want to be found. The searcher will be called Searcher, and the reluctant object of search will be called Evader. Search games are among the most common applications of game theory. A variety of problems can be posed, depending on whether Evader can move, the consequences of detection, whether the space to be searched is discrete or continuous, in the latter case how many dimensions there are, and so on. We have already considered several problems of this kind in previous chapters. These include

Keywords: Optimal Strategy; Unit Disk; Detection Probability; Unit Interval; Active Strategy (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4614-9050-0_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461490500

DOI: 10.1007/978-1-4614-9050-0_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().