Network search games, with arbitrary searcher starting point

Networks

Volumn 52, Issue 3, 2008, Pages 156-161

  Dagan, Arnon ^a   Gal, Shmuel ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Absolute center; Chinese postman; Network search; Search games; Star search; Weakly Eulerian

Indexed keywords

THEOREM PROVING;

ABSOLUTE CENTER; CHINESE POSTMAN; NETWORK SEARCH; SEARCH GAMES; WEAKLY EULERIAN;

GAME THEORY;

EID: 45849096250     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20241     Document Type: Article

References (19)

1. S. Alpern, "The search game with mobile hider on the circle," Differential games and control theory, E.O. Roxin, P.T. Liu, and R.L. Sternberg (Editors), M. Dekker, New York, 1974, pp. 181-200.
2. S. Alpern, How to search a tree to which Eulerian networks are attached, Research Report CDAM-2005-15. Centre for Discrete and Applicable Mathematics, Eondon School of Economics, 2005.
3. S. Alpern and S. Gal, The theory of search games and rendezvous, Kluwer International Series in Operations Research and Management Science, Kluwer, Boston, 2003.
4. S J. Benkoski, M.G. Monticono, and J.R. Weisinger, A survey of the search theory literature, Naval Res Log 38 (1991), 469-494.
5. A. Dagan. Strategies for searching graphs with an arbitrary starting point. Master's Thesis, Department of Computer Science, University of Haifa, Haifa, 2005.
6. D. Dvir and G.Y. Handler, The absolute center of a network, Networks 43 (2004), 109-118.
7. S. Gal, Search games. Academic Press, New York, 1980.
8. S. Gal, On the optimality of a simple strategy for searching graphs. Int J Game Theory 29 (2000), 533-542.
9. S. Gal, Searching a network from an arbitrary stalling point, Fifth CDAM International Workshop on Search Games and Rendezvous, Eondon School of Economics, 2005.
10. S. Gal and E.J. Anderson. Search in a maze, Probab Eng Inf Sci 4 (1990), 311-318.
11. S. Hakimi, Optimal locations of switching centers and medians of a graph, Oper Res 12 ( 1964), 450-459.
12. G.Y. Handler, Minimax location of a facility in an undirected tree graph, Transport Sci 7 (1973), 287-293.
13. G.Y. Handler, Finding two-centers of a tree: The continuous case, Transport Sci 12 (1978), 93-106.
14. R. Hassin and A. Tamir, On the minimum diameter spanning tree problem. Inform Process Lett 53 (1995). 109-111.
15. B.O. Koopman, Search and screening: general principles with historical applications. Pergamon Press, New York. 1980.
16. N. Megiddo and A. Tamir, New results on the complexity of p-center problems, SIAM J Comput 12 (1983), 751-758.
17. E. Rasmusen, Games and information, Blackwell Publishing, Boston. 2001.
18. J.H. Rijnierse and J.A.M. Potters, Search games with immobile hider. Int J Game Theory 21 (1993). 385-394.
19. E.D. Stone, Theory of optimal search, 2nd edition. Operations Research Society of America, Arlington, VA, 1989.