Hide-and-seek games on a tree to which Eulerian networks are attached

Networks

Volumn 52, Issue 3, 2008, Pages 162-166

  Alpern, Steve ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Network; Search game; Zero sum

Indexed keywords

THEOREM PROVING;

CAPTURE TIMES; EULERIAN; FINITE NUMBERS; NETWORK; REVERSE PATHS; SEARCH GAME; SIMPLIFYING ASSUMPTIONS; SINGLE POINTS; TOTAL LENGTHS; ZERO-SUM;

GAME THEORY;

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

References (20)

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), Marcel Dekker, New York, 1974, pp. 181-200.
2. S. Alpern, How to search a tree to which Eulerian networks are attached, Eondon School of Economics, 2005.
3. S. Alpern and M. Asic, The search value of a network, Networks 15 (1986), 229-238.
4. S. Alpern, V. Baston, and S. Gal, Network search games with immobile hider, without a designated searcher starting point. Research Report CDAM-2006-03, Centre for Discrete and Applicable Mathematics, Eondon School of Economics, 2006.
5. S. Alpern, V. Baston, and S. Gal, Searching symmetric networks with utilitarian postman paths, Research Report CDAM-2006-06, Centre for Discrete and Applicable Mathematics, Eondon School of Economics, 2006.
6. S. Alpern and S. Gal, The theory of search games and rendezvous (Kluwer international series in operations research and management science). Kluwer, Boston, 2003.
7. S. Alpern and J.V. Howard, Alternating search at two locations. Dynam Contr 10 (2000), 319-339.
8. E.J. Anderson and M. Aramendia, The search game on a network with immobile hider, Networks 20 (1990), 817-844.
9. V. Baston and A. Beck, Generalizations in the linear search problem, srael J Math 90 (1995), 301-323.
10. A. Dagan, Strategies for searching graphs with an arbitrary starting point, MSc Thesis draft, Statistics Department, University of Haifa, 2005.
11. A. Dagan and S. Gal, Network search games, with arbitrary searcher starting point. Networks (2008), 156-161.
12. D. Dvir and G.Y. Handler, The absolute center of a network, Networks 43 (2004), 109-118.
13. J. Edmonds and E.L. Johnson, Matching Euler tours and the Chinese postman problem, Math Program 5 (1973), 88-124.
14. H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems. I. The Chinese postman problem, Oper Res 43 (1995), 231-242.
15. S. Gal. Search games. Academic Press. New York, 1980.
16. S. Gal, On the optimality of a simple strategy for searching graphs. Int J Game Theory 29 (2000), 533-542.
17. R. Isaacs, Differential games, Wiley, New York, 1965.
18. N. Megiddo and A. Tamir, New results on the complexity of p-center problems, SIAM J Comput 12 (1983), 751-758.
19. J.H. Reijnierse and J.A.M. Potters, Search games with immobile hider. Int J Game Theory 21 (1993). 385-394.
20. M.I. Zeliken, On a differential game with incomplete information, Soviet Math Doklady 13 (1972), 228-231.