Search Games: A Review - Search Theory: A Game Theoretic Perspective - page 14

18. Dagan, A. and Gal, S. (2008). Network search games, with arbitrary searcher starting point.

Networks. 52(3):156-161.

19. Demaine, ED., Fekete, S. and Gal, S. (2006). Online searching with turn cost. Theoretical

Computer Science. 361:342-355.

20. Even, S. (1979). Graph Algorithms. Computer Science Press, Rockville MD. Ch. 3.

21. Edmonds, J, and Johnson, EL. (1973). Matching Euler tours and the Chinese postman prob-

lem. Math. Program. 5:88-124.

22. Gal, S. (1974). Minimax solutions for linear search problems. SIAM J. Appl. Math. 27:17-30.

23. Gal, S. (1979). Search games with mobile and immobile hider. SIAM J. Control Optim. 17:

99-122.

24. Gal, S. (1980). Search Games . Academic Press, New York.

25. Gal, S. (2000). On the optimality of a simple strategy for searching graphs. Int. J. Game

Theory. 29:533-542.

26. Gal, S. (2011). Search Games . Wiley Encyclopedia of Operations Research and Management

Science.

27. Gal, S. and Anderson, EJ. (1990). Search in a maze. Probab. Eng. Inf. Sci. (4):311-318.

28. Gal, S and Chazan, D. (1976). On the optimality of the exponential functions for some mini-

max problems. SIAM J. Appl. Math. 1976 .30:324-348.

29. Garnaev, A. (1992). A Remark on the Princess and Monster Search Game. Int. J. of Game

Theory. 20:269-276.

30. Isaacs, R. (1965). Differential Games . Wiley, New York.

31. Isbell, J. R. (1957). An optimal search pattern. Naval Res. Logist. Quart. (4):357-359.

32. Kao, M, Reif, JH, Tate, SR. (1996). Searching an unknown envitonment: an optimal random-

ized algorithm for the cow-path problem. Inf. Comput. 131(1):63-79.

33. Kao, MY., Ma Y., Sipser, M. and Yin, Y. (1998). Optimal construction of Hybrid algorithm.

J. of Algorithms. 29:142-164.

34. Kella, O. (1993). Star search - a different show. Israel. J. Mathematics. 81:145-159.

35. Lalley, SP. and Robbins, HE. (1988). Stochastic search in a convex region. Probab. Theory

Relat. Fields. 77(1):99-116.

36. Langetepe, E. (2009). On the Optimality of Spiral Search. SODA 2010.

37. López-Ortiz, A. and Schuierer, S. (2001). The ultimate strategy to search on m rays? Theoret-

ical Computer Science. 261(2):267-295.

38. López-Ortiz, A. and Schuierer, S. (2004). Online parallel heuristics, processor scheduling,

and robot searching under the competitive framework. Theoretical Computer Science. 310:
527-537.

39. Lucas, E. (1882). Recreations Mathematique. Paris

40. Pavlovic, L. (1993). Search game on an odd number of arcs with immobile hider. Yugosl.

J. Oper. Res. 3(1):11-19.

41. Schuierer, S. (2003). A lower Bound for Randomized Searching on m Rays, Pp 264-277 in

Klein, R, Six, HW and Wegner, L. eds, Computer Science in Perspective: Essays Dedicated to
Thomas Ottmann, volume 2598 of Lecture Notes Comput. Sci. Springer-Verlag, Berlin.

42. Tarry, G. (1985). La problem des labyrinths. Nouvelles Annals de Mathematique. 14, 187.

43. Von Stengel, B. and Werchner, R. (1997). Complexity of searching an immobile hider in a

graph. Discrete Appl. Math. 78:235-249.

44. Wilson, DJ. (1970). Isaacs' princess and monster game on the circle. JOTA. 9:265-288.

45. Zelikin, MI. (1972). On a differential game with incomplete information. Soviet Math. Dokl.

13:228-231.