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

A generalized inspection game

Author

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

Abstract

The paper addresses the problem of a patrol trying to stop smugglers who are attempting to ship a cargo of perishable contraband across a strait in one of M time units. The situation was modeled as a two‐person zero‐sum game of exhaustion by Thomas and Nisgav and this article extends their results. The game has many characteristics in common with the Inspection Game in Owen's book on Game Theory; this Inspection Game is generalized and the relations between the two games are discussed.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:2:p:171-182
    DOI: 10.1002/1520-6750(199104)38:23.0.CO;2-2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199104)38:23.0.CO;2-2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199104)38:23.0.CO;2-2?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. 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.
    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. Bernhard von Stengel, 2016. "Recursive Inspection Games," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 935-952, August.
    2. 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.
    3. 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.
    4. 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.
    5. Darlington, Matthew & Glazebrook, Kevin D. & Leslie, David S. & Shone, Rob & Szechtman, Roberto, 2023. "A stochastic game framework for patrolling a border," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1146-1158.
    6. Yang, Zhisen & Yang, Zaili & Yin, Jingbo & Qu, Zhuohua, 2018. "A risk-based game model for rational inspections in port state control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 477-495.
    7. 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.
    8. 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.
    9. 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).
    10. Endre Csóka & Thomas Lidbetter, 2016. "The solution to an open problem for a caching game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(1), pages 23-31, 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. 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.
    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. 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.
    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. Thomas S. Ferguson & Costis Melolidakis, 1998. "On the inspection game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 327-334, April.
    7. 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.
    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. 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:navres:v:38:y:1991:i:2:p:171-182. 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.