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

More on the search for an infiltrator

Author

Listed:
  • Ljiljana Pavlović

Abstract

We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 − z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047

Suggested Citation

  • Ljiljana Pavlović, 2002. "More on the search for an infiltrator," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 1-14, February.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:1:p:1-14
    DOI: 10.1002/nav.1047
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.1047
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.1047?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. 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.
    2. S. P. Lalley, 1988. "A one‐dimensional infiltration game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 441-446, October.
    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, 2007. "Discrete search allocation game with false contacts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 46-58, February.
    3. Ryusuke Hohzaki, 2009. "A cooperative game in search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 264-278, April.
    4. 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:49:y:2002:i:1:p:1-14. 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.