IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v23y1976i2p297-302.html
   My bibliography  Save this article

An infiltration game with time dependent payoff

Author

Listed:
  • Marlin U. Thomas
  • Yair Nisgav

Abstract

The problem of assigning patrol boats, subject to resource constraints, to capture or delay an infiltrator with perishable contraband attempting escape across a long, narrow strait is formulated as a two‐sided time sequential game. Optimal mixed strategies are derived for the situation of one patrol boat against one smuggler. Procedures for obtaining numerical solutions for R > 1 patrol boats are discussed.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navlog:v:23:y:1976:i:2:p:297-302
    DOI: 10.1002/nav.3800230211
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800230211
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800230211?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. 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.
    2. 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).
    3. 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.
    4. 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.
    5. 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).
    6. 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.
    7. 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.
    8. Thomas S. Ferguson & Costis Melolidakis, 1998. "On the inspection game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 327-334, April.
    9. 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.
    10. 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.
    11. 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.

    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:navlog:v:23:y:1976:i:2:p:297-302. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.