A Booby Trap Game

References

• Alpern S, Gal S (1988) A mixed-strategy minimax theorem without compactness. SIAM J. Control Optim. 26(6):1357–1361.Crossref, Google Scholar
• Alpern S, Gal S (2003) The Theory of Search Games and Rendezvous (Kluwer Academic Publishers, New York).Google Scholar
• Alpern S, Lidbetter T (2013) Mining coal or finding terrorists: The expanding search paradigm. Oper. Res. 61(2):265–279.Link, Google Scholar
• Alpern S, Gal S, Lee V, Casas J (2019) A stochastic game model of searching predators and hiding prey. J. Roy. Soc. Interface 16(153):20190087.Crossref, Google Scholar
• Angelopoulos S, Lidbetter T (2020) Competitive search in a network. Eur. J. Oper. Res. 286(2):781–790.Crossref, Google Scholar
• Bonato A (2011) The Game of Cops and Robbers on Graphs (American Mathematical Society, Providence, RI).Crossref, Google Scholar
• Bui T, Lidbetter T, Lin KY (2024) Optimal pure strategies for a discrete search game. Eur. J. Oper. Res. 313(2):767–775.Crossref, Google Scholar
• Clarkson J, Lin KY (2025) Computing optimal strategies for a search game in discrete locations. INFORMS J. Comput. 37(3):666–683.Link, Google Scholar
• Clarkson J, Lin KY, Glazebrook KD (2023) A classical search game in discrete locations. Math. Oper. Res. 48(2):687–707.Link, Google Scholar
• Condon A, Deshpande A, Hellerstein L, Wu N (2009) Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Trans. Algorithms 5(2):1–34.Crossref, Google Scholar
• Dagan A, Gal S (2008) Network search games, with arbitrary searcher starting point. Networks 52(3):156–161.Crossref, Google Scholar
• Duvocelle B, Flesch J, Staudigl M, Vermeulen D (2022) A competitive search game with a moving target. Eur. J. Oper. Res. 303(2):945–957.Crossref, Google Scholar
• Even S, Tarjan RE (1976) Computing an st-numbering. Theoretical Comput. Sci. 2(3):339–344.Crossref, Google Scholar
• Gal S (1979) Search games with mobile and immobile hider. SIAM J. Control Optim. 17(1):99–122.Crossref, Google Scholar
• Gal S (2011) Search games. Cochran J, ed. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Hoboken, NJ).Crossref, Google Scholar
• Garrec T (2019) Continuous patrolling and hiding games. Eur. J. Oper. Res. 277(1):42–51.Crossref, Google Scholar
• Halmos P (1950) Measure Theory Van Nostrand (Van Nostrand, New York).Crossref, Google Scholar
• Hohzaki R (2016) Search games: Literature and survey. J. Oper. Res. Soc. Japan 59(1):1–34.Crossref, Google Scholar
• Lempel A, Even S, Cederbaum I (1967) An algorithm for planarity testing of graphs. Proc. Internat. Sympos. Theory Graphs (Gorden and Breach, New York), 215–232. Google Scholar
• Lidbetter T (2013) Search games with multiple hidden objects. SIAM J. Control Optim. 51(4):3056–3074.Crossref, Google Scholar
• Lidbetter T, Lin KY (2019) Searching for multiple objects in multiple locations. Eur. J. Oper. Res. 278(2):709–720.Crossref, Google Scholar
• Lidbetter T, Lin KY (2020) A search game on a hypergraph with booby traps. Theoretical Comput. Sci. 821:57–70.Crossref, Google Scholar
• Ruckle WH (1983) Geometric Games and Their Applications, vol 82 (Pitman Advanced Publishing Program, Boston).Google Scholar
• Slater PJ (1978) Centers to centroids in graphs. J. Graph Theory 2(3):209–222.Crossref, Google Scholar
• Yolmeh A, Baykal-Gürsoy M (2021) Weighted network search games with multiple hidden objects and multiple search teams. Eur. J. Oper. Res. 289(1):338–349.Crossref, Google Scholar