Skip to main content
SpringerLink
Log in

Search Games for an Immobile Hider

  • Chapter
  • First Online:
Search Theory

Abstract

A search game for an immobile hider is a zero-sum game taking place in some search space. The hider picks a point in the space and a searcher who is unaware of the hider’s location moves around attempting to find him in the least possible time. We give an overview of the theory of search games on a network with an immobile hider, starting with their conception in the Rufus Isaac’s 1965 book on Differential Games, then moving on to some classic results in the field from Shmuel Gal and others. Finally we discuss some recent work on new search game models which consider, for example, what happens when the searcher does not have a fixed starting point or when the speed of the searcher depends on the direction in which he is traveling.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alpern, S. (2010). Search games on trees with asymmetric travel times. SIAM J. Control Optim. 48, no. 8, 5547–5563.

    Article  MathSciNet  MATH  Google Scholar 

  2. Alpern, S. (2011). Find-and-fetch search on a tree. Operations Research 59 (2011): 1258–1268.

    Article  MathSciNet  MATH  Google Scholar 

  3. Alpern, A., Baston, V. and Gal, S. (2008). Network Search Games with an immobile hider without a designated searcher starting point, Int. J. Game Theory 37, 281–302.

    Article  MathSciNet  MATH  Google Scholar 

  4. Alpern S. and Gal S. (2003). The Theory of Search Games and Rendezvous (Kluwer International Series in Operation Research and Management Sciences, Kluwer, Boston).

    MATH  Google Scholar 

  5. Alpern, S. and Lidbetter, T. (2013) Searching a Variable Speed Network. Mathematics of Operations research (in press).

    Google Scholar 

  6. Alpern, S. and Lidbetter, T. (2013). Mining Coal or Finding Terrorists: the Expanding Search Paradigm. Operations Research (in press).

    Google Scholar 

  7. Beck, A. (1964). On the linear search Problem. Naval Res. Logist. 2, 221–228

    MATH  Google Scholar 

  8. Bellman, R. (1963). An optimal search problem. SIAM Rev. 5, 274.

    Article  Google Scholar 

  9. Dagan, A. and Gal, S. (2008). Networks Search Games with Arbitrary searcher starting point, Networks 52, 156–161.

    Article  MathSciNet  MATH  Google Scholar 

  10. Gal, S. (1979). Search games with mobile and immobile hider. SIAM J. Control Optim. 17, 99–122.

    Article  MathSciNet  MATH  Google Scholar 

  11. Gal, S. (1980). Search Games. Academic Press, New York.

    MATH  Google Scholar 

  12. Gal, S. (2000). On the optimality of a simple strategy for searching graphs. Int. J. Game Theory 29, 533–542.

    Article  MathSciNet  Google Scholar 

  13. Gal, S. (2011). Search games. Wiley Encyclopedia of Operations Research and Management Sci. (James J. Cochran, ed.), Wiley.

    Google Scholar 

  14. Isaacs, R. (1965). Differential Games. Wiley, New York.

    MATH  Google Scholar 

  15. Pavlovic, L. (1993). Search game on an odd number of arcs with immobile hider. Yugosl. J. Oper. Res. 3, no. 1, 11–19.

    MathSciNet  MATH  Google Scholar 

  16. Reijnierse, J. H. (1995). Games, graphs and algorithms. Ph.D Thesis, University of Nijmegen, The Netherlands.

    Google Scholar 

  17. Reijnierse, J. H. and Potters, J. A. M. (1993). Search games with immobile hider. Int. J. Game Theory 21, 385–394.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, London School of Economics, London, UK

    Thomas Lidbetter

Authors
  1. Thomas Lidbetter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Lidbetter .

Editor information

Editors and Affiliations

  1. University of Warwick, Warwick Business School, Scarman Road, Coventry, CV4 7AL, United Kingdom

    Steve Alpern

  2. , Institute of Applied Mathematics, Technical University Delft, Mekelweg, Delft, 2628 CD, Netherlands

    Robbert Fokkink

  3. , Complexity Theory and Algorithmics Group, University of Liverpool, Ashton Building, Ashton Street, Liverpool, L69 3BX, United Kingdom

    Leszek Gąsieniec

  4. , Section Military Operations Research, Netherlands Defense Academy, Kraanstraat 4, Breda, 4811 MA, Netherlands

    Roy Lindelauf

  5. , Computer Science Department, University of Maryland, AV Williams Building, College Park, 20854, Maryland, USA

    V.S. Subrahmanian

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Lidbetter, T. (2013). Search Games for an Immobile Hider. In: Alpern, S., Fokkink, R., Gąsieniec, L., Lindelauf, R., Subrahmanian, V. (eds) Search Theory. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6825-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6825-7_2

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6824-0

  • Online ISBN: 978-1-4614-6825-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation