IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i3p415-422.html
   My bibliography  Save this article

Dynamic Search Games

Author

Listed:
  • Lyn C. Thomas

    (University of Edinburgh, Edinburgh, Scotland)

  • Alan R. Washburn

    (Naval Postgraduate School, Monterey, California)

Abstract

In these games the searcher has a sequence of looks in which to detect the target, while the target chooses a new cell after each look in the knowledge of what cells have been searched so far. Since time is of the essence and the searcher's speed is bounded, the target has a tendency to choose cells far away from the most recent look. A theory for such games is developed and used to approximate a game involving a dipping sonar.

Suggested Citation

  • Lyn C. Thomas & Alan R. Washburn, 1991. "Dynamic Search Games," Operations Research, INFORMS, vol. 39(3), pages 415-422, June.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:3:p:415-422
    DOI: 10.1287/opre.39.3.415
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.3.415
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.3.415?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos, 1996. "Using multiple searchers in constrained‐path, moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 463-480, June.
    2. Corine M Laan & Ana Isabel Barros & Richard J Boucherie & Herman Monsuur & Wouter Noordkamp, 2020. "Optimal deployment for anti-submarine operations with time-dependent strategies," The Journal of Defense Modeling and Simulation, , vol. 17(4), pages 419-434, October.
    3. J F J Vermeulen & M van den Brink, 2005. "The search for an alerted moving target," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 514-525, May.
    4. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    5. Gordon McCormick & Guillermo Owen, 2019. "A composite game of hide and seek," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 1-14, March.
    6. Laan, Corine M. & van der Mijden, Tom & Barros, Ana Isabel & Boucherie, Richard J. & Monsuur, Herman, 2017. "An interdiction game on a queueing network with multiple intruders," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1069-1080.
    7. David E. Jeffcoat & Pavlo A. Krokhmal & Olesya I. Zhupanska, 2006. "Effects of cueing in cooperative search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 814-821, December.
    8. Kyle Y. Lin & Michael P. Atkinson & Timothy H. Chung & Kevin D. Glazebrook, 2013. "A Graph Patrol Problem with Random Attack Times," Operations Research, INFORMS, vol. 61(3), pages 694-710, June.
    9. Baykal-Gürsoy, Melike & Duan, Zhe & Poor, H. Vincent & Garnaev, Andrey, 2014. "Infrastructure security games," European Journal of Operational Research, Elsevier, vol. 239(2), pages 469-478.
    10. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:39:y:1991:i:3:p:415-422. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.