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

A fast infiltration game on n arcs

Author

Listed:
  • V. J. Baston
  • A. Y. Garnaev

Abstract

Starting from a safe base, an Infiltrator tries to reach a sensitive zone within a given time limit without being detected by a Guard. The Infiltrator can move with speed at most u, while the Guard can only perform a restricted number of searches. A discrete variant of this zero‐sum game played on a graph consisting of two vertices joined by n nonintersecting arcs is investigated. Optimal strategies and an explicit expression for its value are obtained. © 1996 John Wiley & Sons, Inc.

Suggested Citation

  • V. J. Baston & A. Y. Garnaev, 1996. "A fast infiltration game on n arcs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 481-489, June.
    • Handle: RePEc:wly:navres:v:43:y:1996:i:4:p:481-489
    DOI: 10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-3
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-3
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199606)43:43.0.CO;2-3?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. R. D. Foley & T. P. Hill & M. C. Spruill, 1991. "Linear search with bounded resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 555-565, August.
    2. Marlin U. Thomas & Yair Nisgav, 1976. "An infiltration game with time dependent payoff," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(2), pages 297-302, June.
    3. John M. Auger, 1991. "An infiltration game on k arcs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 511-529, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zoroa, N. & Zoroa, P. & Fernández-Sáez, M.J., 2009. "Weighted search games," European Journal of Operational Research, Elsevier, vol. 195(2), pages 394-411, June.
    2. Alpern, Steve & Lidbetter, Thomas & Papadaki, Katerina, 2019. "Optimizing periodic patrols against short attacks on the line and other networks," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1065-1073.

    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. Andrej Yu Garnaev, 1994. "A remark on the customs and smuggler game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(2), pages 287-293, March.
    2. Ederlina Ganatuin‐Nocon & Tyrone Ang, 2020. "Revisiting inspection game and inspector leadership through reaction networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 438-452, September.
    3. Guzmán, Cristóbal & Riffo, Javiera & Telha, Claudio & Van Vyve, Mathieu, 2022. "A sequential Stackelberg game for dynamic inspection problems," European Journal of Operational Research, Elsevier, vol. 302(2), pages 727-739.
    4. Steve Alpern & Alec Morton & Katerina Papadaki, 2011. "Patrolling Games," Operations Research, INFORMS, vol. 59(5), pages 1246-1257, October.
    5. Morton Canty & Daniel Rothenstein & Rudolf Avenhaus, 2001. "A sequential attribute sampling inspection game for item facilities," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 496-505, September.
    6. Guzman, Cristobal & Riffo, Javiera & Telha, Claudio & Van Vyve, Mathieu, 2021. "A Sequential Stackelberg Game for Dynamic Inspection Problems," LIDAM Discussion Papers CORE 2021036, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. V. J. Baston & F. A. Bostock, 1991. "A generalized inspection game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(2), pages 171-182, April.
    8. Ryusuke Hohzaki & Diasuke Kudoh & Toru Komiya, 2006. "An inspection game: Taking account of fulfillment probabilities of players' aims," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 761-771, December.
    9. Yang, Zhisen & Wan, Chengpeng & Yang, Zaili & Yu, Qing, 2021. "Using Bayesian network-based TOPSIS to aid dynamic port state control detention risk control decision," Reliability Engineering and System Safety, Elsevier, vol. 213(C).
    10. Zoroa, N. & Fernández-Sáez, M.J. & Zoroa, P., 2012. "Patrolling a perimeter," European Journal of Operational Research, Elsevier, vol. 222(3), pages 571-582.
    11. Steve Alpern & Anatole Beck, 1999. "Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting," Operations Research, INFORMS, vol. 47(6), pages 849-861, December.
    12. Deutsch, Yael, 2021. "A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game," European Journal of Operational Research, Elsevier, vol. 288(3), pages 1036-1052.
    13. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    14. Zoroa, N. & Zoroa, P. & Fernández-Sáez, M.J., 2009. "Weighted search games," European Journal of Operational Research, Elsevier, vol. 195(2), pages 394-411, June.
    15. 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.
    16. Thomas S. Ferguson & Costis Melolidakis, 1998. "On the inspection game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 327-334, April.

    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:43:y:1996:i:4:p:481-489. 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.