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

Cumulative search‐evasion games

Author

Listed:
  • James N. Eagle
  • Alan R. Washburn

Abstract

Cumulative search‐evasion games (CSEGs) are two‐person zero‐sum search‐evasion games where play proceeds throughout some specified period without interim feedback to either of the two players. Each player moves according to a preselected plan. If (Xt, Yt,) are the positions of the two players at time t, then the game's payoff is the sum over t from 1 to T of A(Xt, Yt, t). Additionally, all paths must be “connected.” That is, the finite set of positions available for a player in any time period depends on the position selected by that player in the previous time period. One player attempts to select a mixed strategy over the feasible T‐time period paths to maximize the expected payoff. The other minimizes. Two solution procedures are given. One uses the Brown‐Robinson method of fictitious play and the other linear programming. An example problem is solved using both procedures.

Suggested Citation

  • James N. Eagle & Alan R. Washburn, 1991. "Cumulative search‐evasion games," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 495-510, August.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:4:p:495-510
    DOI: 10.1002/1520-6750(199108)38:43.0.CO;2-6
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199108)38:43.0.CO;2-6
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199108)38:43.0.CO;2-6?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. James N. Eagle, 1984. "The Optimal Search for a Moving Target When the Search Path Is Constrained," Operations Research, INFORMS, vol. 32(5), pages 1107-1115, October.
    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. Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos, 1996. "Using multiple searchers in constrained‐path, moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 463-480, June.
    2. Ryusuke Hohzaki, 2008. "A search game taking account of attributes of searching resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 76-90, February.
    3. Ljiljana Pavlović, 2002. "More on the search for an infiltrator," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 1-14, February.
    4. Ryusuke Hohzaki, 2007. "Discrete search allocation game with false contacts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 46-58, February.
    5. Ryusuke Hohzaki, 2009. "A cooperative game in search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 264-278, April.

    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. Jing Li & Ming Dong & Yijiong Ren & Kaiqi Yin, 2015. "How patient compliance impacts the recommendations for colorectal cancer screening," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 920-937, November.
    2. Malek Ebadi & Raha Akhavan-Tabatabaei, 2021. "Personalized Cotesting Policies for Cervical Cancer Screening: A POMDP Approach," Mathematics, MDPI, vol. 9(6), pages 1-20, March.
    3. J F J Vermeulen & M van den Brink, 2005. "The search for an alerted moving target," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 514-525, May.
    4. Turgay Ayer & Oguzhan Alagoz & Natasha K. Stout & Elizabeth S. Burnside, 2016. "Heterogeneity in Women’s Adherence and Its Role in Optimal Breast Cancer Screening Policies," Management Science, INFORMS, vol. 62(5), pages 1339-1362, May.
    5. Turgay Ayer & Oguzhan Alagoz & Natasha K. Stout, 2012. "OR Forum---A POMDP Approach to Personalize Mammography Screening Decisions," Operations Research, INFORMS, vol. 60(5), pages 1019-1034, October.
    6. Ali Hajjar & Oguzhan Alagoz, 2023. "Personalized Disease Screening Decisions Considering a Chronic Condition," Management Science, INFORMS, vol. 69(1), pages 260-282, January.
    7. Andrej Y U. Garnaev, 1993. "A remark on a helicopter and submarine game," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 745-753, August.
    8. Hong, Sung-Pil & Cho, Sung-Jin & Park, Myoung-Ju, 2009. "A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search," European Journal of Operational Research, Elsevier, vol. 193(2), pages 351-364, March.
    9. 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.
    10. Corine M. Laan & Ana Isabel Barros & Richard J. Boucherie & Herman Monsuur & Judith Timmer, 2019. "Solving partially observable agent‐intruder games with an application to border security problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(2), pages 174-190, March.
    11. Michael P. Atkinson & Moshe Kress & Roberto Szechtman, 2017. "To catch an intruder: Part A—uncluttered scenario," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 29-40, February.
    12. Zong-Zhi Lin & James C. Bean & Chelsea C. White, 2004. "A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 27-38, February.
    13. Yanling Chang & Alan Erera & Chelsea White, 2015. "A leader–follower partially observed, multiobjective Markov game," Annals of Operations Research, Springer, vol. 235(1), pages 103-128, December.
    14. Bourque, François-Alex, 2019. "Solving the moving target search problem using indistinguishable searchers," European Journal of Operational Research, Elsevier, vol. 275(1), pages 45-52.
    15. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    16. Lyn C. Thomas & James N. Eagle, 1995. "Criteria and approximate methods for path‐constrained moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 27-38, February.
    17. Zehra Önen Dumlu & Serpil Sayın & İbrahim Hakan Gürvit, 2023. "Screening for preclinical Alzheimer’s disease: Deriving optimal policies using a partially observable Markov model," Health Care Management Science, Springer, vol. 26(1), pages 1-20, March.
    18. Givon, Moshe & Grosfeld-Nir, Abraham, 2008. "Using partially observed Markov processes to select optimal termination time of TV shows," Omega, Elsevier, vol. 36(3), pages 477-485, June.
    19. Adel Guitouni & Hatem Masri, 2014. "An orienteering model for the search and rescue problem," Computational Management Science, Springer, vol. 11(4), pages 459-473, October.
    20. Robert F. Dell & James N. Eagle & Gustavo Henrique Alves Martins & Almir Garnier Santos, 1996. "Using multiple searchers in constrained‐path, moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 463-480, June.

    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:4:p:495-510. 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.