Advertisement

Search Games

  • Alan Washburn
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 201)

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 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Arnold, R. (1962). Avoidance in one dimension: a continuous matrix game. Operations Evaluation Group report OEG IRM-10, Chief of Naval Operations, Washington.Google Scholar
  2. Bram, J. (1963). A 2-player N-region search game. Operations Evaluation Group report OEG IRM-31 (AD 402914), Chief of Naval Operations, Washington.Google Scholar
  3. Danskin, J. (1968). A helicopter submarine search game. Operations Research, 16(3), 509–517.CrossRefGoogle Scholar
  4. Danskin, J. (1990). On the cookie cutter game: search and evasion on a Disc. Mathematics of Operations Research, 15(4), 573–596.CrossRefGoogle Scholar
  5. Dresher, M. (1961). Games of strategy theory and applications. Prentice-Hall, subsequently republished in 1980 as The Mathematics of Games of Strategy Theory and Applications, Dover.Google Scholar
  6. Fodor, F. (1999). The densest packing of 19 congruent circles in a circle. Geometriae Dedicata, 74, 139–145.CrossRefGoogle Scholar
  7. Hohzaki, R., & Iida, K. (1998). A search game with reward criterion. Journal of the Operations Research Society of Japan, 41(4), 629–642.Google Scholar
  8. Hohzaki, R., & Washburn, A. (2001). The diesel submarine flaming datum problem. Military Operations Research, 6(4), 19–30.CrossRefGoogle Scholar
  9. Isaacs, R. (1965). Differential Games, Wiley.Google Scholar
  10. Kikuta, K., & Ruckle, W. (1994). Initial point search on weighted trees. Naval Research Logistics, 41(6), 821–831.CrossRefGoogle Scholar
  11. Lalley, S., & Robbins, H. (1988). Stochastic search in a convex region. Probability Theory and Related Fields, 77(1), 99–116.CrossRefGoogle Scholar
  12. Neuts, M. (1963). A multistage search game. Society for Industrial and Applied Mathematics, 11(2), 502–507.CrossRefGoogle Scholar
  13. Norris, R. (1962). Studies in search for a conscious evader. Report 279 (AD 294832), Lincoln Lab, MIT, Cambridge, MA.Google Scholar
  14. Raghavan, T., & Filar, J. (1991). Algorithms for stochastic games–a survey. Methods and Models of Operations Research, 35(6), 437–472.Google Scholar
  15. Sakaguchi, M. (1973). Two-sided search games. Journal of the Operations Research Society of Japan, 16, 207–225.Google Scholar
  16. Stone, L. (1975). Theory of Optimal Search. Academic Press.Google Scholar
  17. Thomas, L., & Washburn, A. (1991). Dynamic search games. Operations Research, 39(3), 415–422.CrossRefGoogle Scholar
  18. Washburn, A. (1980). Search evasion game in a fixed region. Operations Research, 28(6), 1290–1298.CrossRefGoogle Scholar
  19. Washburn, A. (2002). Search and detection (pp. 2–14). MD: INFORMS, Linthicum.Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Alan Washburn
    • 1
  1. 1.Operations Research DepartmentNaval Postgraduate SchoolMontereyUSA

Personalised recommendations