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

A continuous game of ambush

Author

Listed:
  • V. J. Baston
  • F. A. Bostock

Abstract

The article considers a two‐person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficult.

Suggested Citation

  • V. J. Baston & F. A. Bostock, 1987. "A continuous game of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 645-654, October.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:5:p:645-654
    DOI: 10.1002/1520-6750(198710)34:53.0.CO;2-0
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198710)34:53.0.CO;2-0
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198710)34:53.0.CO;2-0?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. William Ruckle & Robert Fennell & Paul T. Holmes & Charles Fennemore, 1976. "Ambushing Random Walks I: Finite Models," Operations Research, INFORMS, vol. 24(2), pages 314-324, April.
    2. William H. Ruckle & John R. Reay, 1981. "Ambushing Random Walks III: More Continuous Models," Operations Research, INFORMS, vol. 29(1), pages 121-129, February.
    3. William H. Ruckle, 1981. "Ambushing Random Walks II: Continuous Models," Operations Research, INFORMS, vol. 29(1), pages 108-120, February.
    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. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    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.
    3. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    4. Alpern, Steve & Fokkink, Robbert & Simanjuntak, Martin, 2016. "Optimal search and ambush for a hider who can escape the search region," European Journal of Operational Research, Elsevier, vol. 251(3), pages 707-714.
    5. I.D. Woodward, 2003. "Discretization of the continuous ambush game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 515-529, August.
    6. Vic Baston & Kensaku Kikuta, 2009. "Technical Note---An Ambush Game with a Fat Infiltrator," Operations Research, INFORMS, vol. 57(2), pages 514-519, April.
    7. Zoroa, Noemi & Zoroa, Procopio & Jose Fernandez-Saez, M., 1999. "A generalization of Ruckle's results for an ambush game," European Journal of Operational Research, Elsevier, vol. 119(2), pages 353-364, December.
    8. Noemí Zoroa & Procopio Zoroa & José Fernández‐Sáez, 2001. "New results on a Ruckle problem in discrete games of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(1), pages 98-106, February.

    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. K. T. Lee, 1990. "On ruckle's game of ambush," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 355-363, June.
    2. Hohzaki, Ryusuke & Iida, Koji, 2001. "Optimal ambushing search for a moving target," European Journal of Operational Research, Elsevier, vol. 133(1), pages 120-129, August.
    3. I.D. Woodward, 2003. "Discretization of the continuous ambush game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 515-529, August.
    4. Vic Baston & Kensaku Kikuta, 2009. "Technical Note---An Ambush Game with a Fat Infiltrator," Operations Research, INFORMS, vol. 57(2), pages 514-519, April.
    5. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    6. V. J. Baston & F. A. Bostock, 1989. "A one‐dimensional helicopter‐submarine game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(4), pages 479-490, August.
    7. Vic Baston & Kensaku Kikuta, 2004. "An Ambush Game with an Unknown Number of Infiltrators," Operations Research, INFORMS, vol. 52(4), pages 597-605, August.
    8. 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.

    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:34:y:1987:i:5:p:645-654. 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.