Mining Coal or Finding Terrorists: The Expanding Search Paradigm

References

• Alpern S. Rendezvous search: A personal perspective. Oper. Res. (2002) 50(3):772–795Link, Google Scholar
• Alpern S. Search games on trees with asymmetric travel times. SIAM J. Control Optim. (2010) 48(8):5547–5563Crossref, Google Scholar
• Alpern S. A new approach to Gal's theory of search games for immobile hiders on a network. Dynam. Games Appl. (2011a) 1(2):209–219Crossref, Google Scholar
• Alpern S. Find-and-fetch on a tree. Oper. Res. (2011b) 59(5):1246–1257Link, Google Scholar
• Alpern S, Gal S. A mixed strategy minimax theorem without compactness. SIAM J. Control Optim. (1988) 26(6):1357–1361Crossref, Google Scholar
• Alpern S, Gal S. The Theory of Search Games and Rendezvous (2003) (Kluwer, Boston) 319Kluwer International Series in Operations Research and Management SciencesGoogle Scholar
• Alpern S, Howard JV. Alternating search at two locations. Dynam. Control (2000) 10(4):319–339Crossref, Google Scholar
• Alpern S, Lidbetter TR. Searching a variable speed network. Math. Oper. Res. (2013) . ForthcomingGoogle Scholar
• Anderson EJ, Aramendia M. The search game on a network with immobile hider. Networks (1990) 20(7):817–844Crossref, Google Scholar
• Anderson EJ, Essegaier S. Rendezvous search on the line with indistinguishable players. SIAM J. Control Optim. (1995) 33(6):1637–1642Crossref, Google Scholar
• Baston VJ, Bostock FA. An evasion game on a finite tree. SIAM J. Control Optim. (1990) 28(3):671–677Crossref, Google Scholar
• Chester EJ, Tütüncü R. Rendezvous search on the labeled line. Oper. Res. (2004) 52(2):330–334Link, Google Scholar
• Dechter R, Pearl J. Generalized best-first search strategies and the optimality of A*. J. ACM (1985) 32(3):505–536Crossref, Google Scholar
• Du D, Hwang F. Combinatorial Group Testing and Its Applications (2000) (World Scientific Publishing Co., Singapore) Google Scholar
• Gal S. Search games with mobile and immobile hider. SIAM J. Control Optim. (1979) 17(1):99–122Crossref, Google Scholar
• Gal S. Search Games (1980) (Academic Press, New York) Google Scholar
• Gal S. Rendezvous search on the line. Oper. Res. (1999) 47(6):974–976Link, Google Scholar
• Gal S. On the optimality of a simple strategy for searching graphs. Internat. J. Game Theory (2000) 29(4):533–542Crossref, Google Scholar
• Gal S. Search games. Wiley Encylopedia of OR and MS (2011) (John Wiley & Sons, Hoboken, NJ) Crossref, Google Scholar
• Gal S, Howard JV. Rendezvous-evasion search in two boxes. Oper. Res. (2005) 53(4):689–697Link, Google Scholar
• Gittins JC. Multi-armed bandit allocation indices. (1989) (John Wiley & Sons, Chichester, UK) Google Scholar
• Gittins JC, Roberts DM. The search for an intelligent evader concealed in one of an arbitrary number of regions. Naval Res. Logist. Quart. (1979) 26(4):651–666Crossref, Google Scholar
• Jotshi A, Batta R. Search for an immobile entity on a network. Eur. J. Oper. Res. (2008) 191(2):347–359Crossref, Google Scholar
• Kikuta K, Ruckle W. Initial point search on weighted trees. Naval Res. Logist. (1994) 41(6):821–831Crossref, Google Scholar
• Lavalle S. Planning Algorithms (2006) (Cambridge University Press, New York) Crossref, Google Scholar
• Lim WS. A rendezvous-evasion game on discrete locations with joint randomization. Adv. Appl. Probab. (1997) 29(4):1004–1017Crossref, Google Scholar
• Megiddo N, Hakimi SL, Garey MR, Johnson DS, Papadimitriou CH. The complexity of searching a graph. J. ACM (1988) 35(1):18–44Crossref, Google Scholar
• Pavlovic L. A search game on the union of graphs with immobile hider. Naval Res. Logist. (1995) 42(8):1177–1199Crossref, Google Scholar
• Reijnierse JH, Potter JAM. Search games with immobile hider. Internat. J. Game Theory (1993) 21:385–394Crossref, Google Scholar
• Reyniers DJ. Coordinating two searchers for an object hidden on an interval. J. Oper. Res. Soc. (1995) 46(11):1386–1392Crossref, Google Scholar
• Reyniers DJ. Coordinated search for an object hidden on the line. Eur. J. Oper. Res. (1996) 95(3):663–670Crossref, Google Scholar
• Robbins HE. A theorem on graphs, with an application to a problem on traffic control. Amer. Math. Monthly (1939) 46:281–283Crossref, Google Scholar
• Roberts DM, Gittins JC. The search for an intelligent evader: Strategies for searcher and evader in the two-region problem. Naval Res. Logist. Quart. (1978) 25(1):95–106Crossref, Google Scholar
• Thomas LC. Finding your kids when they are lost. J. Oper. Res. Soc. (1992) 43(6):637–639Crossref, Google Scholar