Hide-and-Seek Games on a Network, Using Combinatorial Search Paths

References

• Alpern S (1995) The rendezvous search problem. SIAM J. Control Optim. 33(3):673–683.Crossref, Google Scholar
• Alpern S (2002) Rendezvous search: A personal perspective. Oper. Res. 50(5):772–795.Link, Google Scholar
• Alpern S (2010) Search games on trees with asymmetric travel times. SIAM J. Control Optim. 48(8):5547–5563.Crossref, Google Scholar
• Alpern S (2011a) Find-and-fetch search on a tree. Oper. Res. 59(5):1258–1268.Link, Google Scholar
• Alpern S (2011b) A new approach to Gal’s theory of search games on weakly Eulerian networks. Dynam. Games Appl. 1(2):209–219.Crossref, Google Scholar
• Alpern S, Gal S (2003) The Theory of Search Games and Rendezvous, Kluwer International Series in Operations Research and Management Science (Kluwer, Boston).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, Lidbetter T (2014) Searching a variable speed network. Math. Oper. Res. 39(3):697–711.Link, Google Scholar
• Alpern S, Lidbetter T (2015) Optimal trade-off between speed and acuity when searching for a small object. Oper. Res. 63(1):122–133.Link, Google Scholar
• Alpern S, Fokkink R, Gąsieniec RL, Lindelauf R, Subrahmanian VS (2013). Search Theory: A Game Theoretic Perspective (Springer, New York).Crossref, Google Scholar
• Anderson EJ, Aramendia M (1990) The search game on a network with immobile hider. Networks 20(7):817–844.Crossref, Google Scholar
• Baston V (1999) Two rendezvous search problems on the line. Naval Res. Logist. 46(3):335–340.Crossref, Google Scholar
• Baston V, Kikuta K (2015) Search games on a network with travelling and search costs. Internat. J. Game Theory 44(2):347–365.Crossref, Google Scholar
• Bostock FA (1984) On a discrete search problem of three arcs. SIAM J. Algebraic Discrete Methods 5(1):94–100.Crossref, Google Scholar
• Chester EJ, Tütüncü RH (2004) Rendezvous search on the labeled line. Oper. Res. 52(2):330–334.Link, Google Scholar
• Dagan A, Gal S (2008) Network search games, with arbitrary searcher starting point. Networks 52(3):156–161.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 (1980) Search Games (Academic Press, New York).Google Scholar
• Gal S (1999) Rendezvous search on the line. Oper. Res. 47(6):974–976.Link, Google Scholar
• Gal S (2000) On the optimality of a simple strategy for searching graphs. Int. J. Game Theory 29(4):533–542.Crossref, Google Scholar
• Gal S (2005) Strategies for searching graphs. Golumbic M, Hartman I, eds. Graph Theory, Combinatorics and Algorithms, Vol. 34, Operations Research/Computer Science Interfaces Series (Springer, New York), 189–214.Crossref, Google Scholar
• Gal S (2011) Search games. Cochran JJ, Cox LA Jr, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ)Crossref, Google Scholar
• Gal S (2013) Search games: A review. Alpern S, Fokkink R, Gąieniec L, Lindelauf R, Subrahmanian VS, eds. Search Theory: A Game Theoretic Perspective (Springer, New York), 3–15.Crossref, Google Scholar
• Garnaev A (2000) Search games and other applications of game theory. Lecture Notes in Economics and Mathematical Systems, Vol. 485, (Springer, New York).Crossref, Google Scholar
• Hohzaki R (2016) Search games: Literature and survey. J. Oper. Res. Society of Japan 59(1):1–34.Crossref, Google Scholar
• Howard JV (1999) Rendezvous search on the interval and the circle. Oper. Res. 47(4):550–558.Link, Google Scholar
• Isaacs R (1965) Differential Games (John Wiley & Sons, New York).Google Scholar
• Lidbetter TR (2013) Search games with multiple hidden objects. SIAM J. Control Optim. 51(4):3056–3074.Crossref, Google Scholar
• Lidbetter TR (2013) Search games for an immobile hider. Alpern S, Fokkink R, Gąsieniec L, Lindelauf R, Subrahmanian VS, eds. Search Theory: A Game Theoretic Perspective (Springer, New York), 17–27.Crossref, Google Scholar
• Pavlovic L (1993) Search game on an odd number of arcs with immobile hider. Yugosl. J. Oper. Res. 3(1):11–19.Google Scholar
• Reijnierse JH, Potter JAM (1993). Search games with immobile hider. Int. J. Game Theory 21(4):385–394.Crossref, Google Scholar
• Zoroa N, Fernández-Sáez MJ, Zoroa P (2013) Tools to manage search games on lattices. Alpern S, Fokkink, R, Gąsieniec L, Lindelauf R, Subrahmanian VS, eds. Search Theory: A Game Theoretic Perspective (Springer, New York), 29–58.Crossref, Google Scholar