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

Timely exposure of a secret project: Which activities to monitor?

Author

Listed:
  • Ben Hermans
  • Herbert Hamers
  • Roel Leus
  • Roy Lindelauf

Abstract

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.

Suggested Citation

  • Ben Hermans & Herbert Hamers & Roel Leus & Roy Lindelauf, 2019. "Timely exposure of a secret project: Which activities to monitor?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 451-468, September.
  • Handle: RePEc:wly:navres:v:66:y:2019:i:6:p:451-468
    DOI: 10.1002/nav.21862
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21862
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21862?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. Pinker, Edieal & Szmerekovsky, Joseph & Tilson, Vera, 2014. "On the complexity of project scheduling to minimize exposed time," European Journal of Operational Research, Elsevier, vol. 237(2), pages 448-453.
    2. Bernhard von Stengel, 2016. "Recursive Inspection Games," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 935-952, August.
    3. Michael Atkinson & Moshe Kress & Rutger-Jan Lange, 2016. "When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence," Operations Research, INFORMS, vol. 64(2), pages 315-328, April.
    4. Dennis Leech, 2002. "An Empirical Comparison of the Performance of Classical Power Indices," Political Studies, Political Studies Association, vol. 50(1), pages 1-22, March.
    5. Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(1), pages 1-9.
    6. Kyle Y. Lin & Moshe Kress & Roberto Szechtman, 2009. "Scheduling policies for an antiterrorist surveillance system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 113-126, March.
    7. Pradeep Dubey & Abraham Neyman & Robert James Weber, 1981. "Value Theory Without Efficiency," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 122-128, February.
    8. Avenhaus, Rudolf & Canty, Morton John, 2005. "Playing for time: A sequential inspection game," European Journal of Operational Research, Elsevier, vol. 167(2), pages 475-492, December.
    9. Kyle Y. Lin & Michael P. Atkinson & Kevin D. Glazebrook, 2014. "Optimal patrol to uncover threats in time when detection is imperfect," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 557-576, December.
    10. Nedialko B Dimitrov & Moshe Kress & Yuval Nevo, 2016. "Finding the needles in the haystack: efficient intelligence processing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(6), pages 801-812, June.
    11. Edward H. Kaplan, 2012. "OR Forum---Intelligence Operations Research: The 2010 Philip McCord Morse Lecture," Operations Research, INFORMS, vol. 60(6), pages 1297-1309, December.
    12. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    13. Roberto Szechtman & Moshe Kress & Kyle Lin & Dolev Cfir, 2008. "Models of sensor operations for border surveillance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 27-41, February.
    14. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, 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. van Beek, Andries, 2023. "Solutions in multi-actor projects with collaboration and strategic incentives," Other publications TiSEM 3739c498-5edb-442f-87d8-c, Tilburg University, School of Economics and Management.
    2. Szmerekovsky, Joseph G. & Venkateshan, Prahalad & Simonson, Peter D., 2023. "Project scheduling under the threat of catastrophic disruption," European Journal of Operational Research, Elsevier, vol. 309(2), pages 784-794.
    3. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.

    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. Sushil Gupta & Martin K. Starr & Reza Zanjirani Farahani & Mahsa Mahboob Ghodsi, 2020. "Prevention of Terrorism–An Assessment of Prior POM Work and Future Potentials," Production and Operations Management, Production and Operations Management Society, vol. 29(7), pages 1789-1815, July.
    2. 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.
    3. Vassili Kolokoltsov, 2017. "The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 915-944, November.
    4. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    5. Katerina Papadaki & Steve Alpern & Thomas Lidbetter & Alec Morton, 2016. "Patrolling a Border," Operations Research, INFORMS, vol. 64(6), pages 1256-1269, December.
    6. von Stengel, Bernhard, 2016. "Recursive inspection games," LSE Research Online Documents on Economics 68299, London School of Economics and Political Science, LSE Library.
    7. 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.
    8. Laruelle, Annick & Valenciano, Federico, 2008. "Noncooperative foundations of bargaining power in committees and the Shapley-Shubik index," Games and Economic Behavior, Elsevier, vol. 63(1), pages 341-353, May.
    9. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    10. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    11. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
    12. Albizuri, M.J., 2008. "Axiomatizations of the Owen value without efficiency," Mathematical Social Sciences, Elsevier, vol. 55(1), pages 78-89, January.
    13. Giulia Cesari & Roberto Lucchetti & Stefano Moretti, 2017. "Generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 919-939, November.
    14. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    15. Vicki Bier & Naraphorn Haphuriwat, 2011. "Analytical method to identify the number of containers to inspect at U.S. ports to deter terrorist attacks," Annals of Operations Research, Springer, vol. 187(1), pages 137-158, July.
    16. Saari, Donald G. & Sieberg, Katri K., 2001. "Some Surprising Properties of Power Indices," Games and Economic Behavior, Elsevier, vol. 36(2), pages 241-263, August.
    17. David Simchi-Levi & Nikolaos Trichakis & Peter Yun Zhang, 2019. "Designing Response Supply Chain Against Bioattacks," Operations Research, INFORMS, vol. 67(5), pages 1246-1268, September.
    18. Takayuki Mizuno & Shohei Doi & Shuhei Kurizaki, 2020. "The power of corporate control in the global ownership network," PLOS ONE, Public Library of Science, vol. 15(8), pages 1-19, August.
    19. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    20. Fujimoto, Katsushige & Kojadinovic, Ivan & Marichal, Jean-Luc, 2006. "Axiomatic characterizations of probabilistic and cardinal-probabilistic interaction indices," Games and Economic Behavior, Elsevier, vol. 55(1), pages 72-99, 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:66:y:2019:i:6:p:451-468. 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.