IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v54y2007i1p46-58.html
   My bibliography  Save this article

Discrete search allocation game with false contacts

Author

Listed:
  • Ryusuke Hohzaki

Abstract

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007

Suggested Citation

  • Ryusuke Hohzaki, 2007. "Discrete search allocation game with false contacts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 46-58, February.
  • Handle: RePEc:wly:navres:v:54:y:2007:i:1:p:46-58
    DOI: 10.1002/nav.20177
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20177
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.20177?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
    ---><---

    References listed on IDEAS

    as
    1. John M. Danskin, 1968. "A Helicopter Versus Submarine Search Game," Operations Research, INFORMS, vol. 16(3), pages 509-517, June.
    2. Alan R. Washburn, 1980. "Search-Evasion Game in a Fixed Region," Operations Research, INFORMS, vol. 28(6), pages 1290-1298, December.
    3. James N. Eagle & Alan R. Washburn, 1991. "Cumulative search‐evasion games," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 495-510, August.
    4. Hohzaki, Ryusuke & Iida, Koji, 2000. "A search game when a search path is given," European Journal of Operational Research, Elsevier, vol. 124(1), pages 114-124, July.
    5. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ryusuke Hohzaki, 2008. "A search game taking account of attributes of searching resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 76-90, February.
    2. Ryusuke Hohzaki, 2009. "A cooperative game in search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 264-278, April.
    3. Hohzaki, Ryusuke, 2006. "Search allocation game," European Journal of Operational Research, Elsevier, vol. 172(1), pages 101-119, July.
    4. Hohzaki, Ryusuke & Iida, Koji, 2000. "A search game when a search path is given," European Journal of Operational Research, Elsevier, vol. 124(1), pages 114-124, July.
    5. 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.
    6. 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.
    7. Köji Iida, 1989. "Optimal search plan minimizing the expected risk of the search for a target with conditionally deterministic motion," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 597-613, October.
    8. Ljiljana Pavlović, 2002. "More on the search for an infiltrator," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 1-14, February.
    9. Andrey Garnaev & Kensaku Kikuta, 2014. "Screening and hiding versus search," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(3), pages 255-265, December.
    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.
    11. Zoroa, N. & Fernández-Sáez, M.J. & Zoroa, P., 2011. "A foraging problem: Sit-and-wait versus active predation," European Journal of Operational Research, Elsevier, vol. 208(2), pages 131-141, January.
    12. 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.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:54:y:2007:i:1:p:46-58. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.