Network search games with immobile hider, without a designated searcher starting point

International Journal of Game Theory

Volumn 37, Issue 2, 2008, Pages 281-302

  Alpern, Steve ^a   Baston, Vic ^a,b   Gal, Shmuel ^c  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Chinese postman; Eulerian; Network; Search game; Zero sum

Indexed keywords

EID: 45849083859     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00182-008-0116-7     Document Type: Article

References (26)

1. Alpern S (1974) The search game with mobile hider on the circle. In: Roxin EO, Liu PT, Sternberg RL(eds) Differential games and control theory. M. Dekker, New York, pp 181-200
2. Alpern S (2008) Hide-and-seek games on a tree to which Eulerian networks are attached. Networks (in press)
3. Alpern S, Asic M (1985) The search value of a network. Networks 15(2): 229-238
4. Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer International Series in Operations Research and Management Sciences. Kluwer, Boston, p 319
5. Alpern S, Howard JV (2000) Alternating search at two locations. Dyn Control 10: 319-339
6. Anderson EJ, Aramendia MA (1990) The search game on a network with immobile hider. Networks 20(7): 817-844
7. Beck A, Newman DJ (1970) Yet more on the linear search problem. Nav Res Logist 8: 419-429
8. Dagan A (2005) Strategies for searching graphs with an arbitrary starting point, MSc Thesis, University of Haifa
9. Dagan A, Gal S (2008) Network search games with arbitrary searcher starting point. Networks (in press)
10. Demaine E, Fekete S, Gal S (2006) Online searching with turn cost. Theor Comput Sci 361: 342-355
11. Dvir D, Handler GY (2004) The absolute center of a network. Networks 43(2): 109-118
12. Edmonds J, Johnson EL (1973) Matching Euler tours and the Chinese postman problem. Math Program 5: 88-124
13. Eiselt HA, Gendreau M, Laporte G (1995) Arc routing problems I. The Chinese postman problem. Oper Res 43: 231-242
14. Gal S (1980) Search games. Academic Press, New York
15. Gal S (2000) On the optimality of a simple strategy for searching graphs. Int J Game Theory 29: 533-542
16. Garnaev AY (2000) Search games and other applications of game theory. Springer, Berlin
17. Hakimi S (1964) Optimal locations of switching centers and medians of a graph. Oper Res 12: 450-459
18. Hassin R, Tamir A (1995) On the minimum diameter spanning tree problem. Inf Process Lett 53: 109-111
19. Isaacs R (1965) Differential games. Wiley, New York
20. Kikuta K (1995) A search game with traveling cost on a tree. J Oper Res Soc Jpn 38(1): 70-88
21. Megiddo N, Tamir A (1983) New results on the complexity of p-center problems. SIAM J Comput 12(4): 751-758
22. Pavlovic L (1995) A search game on the union of graphs with immobile hider. Nav Res Logist 42(8): 1177-1189
23. Reijnierse JH, Potters JAM (1993) Search games with immobile hider. Int J Game Theory 21: 385-394
24. Ruckle WH (1983) Geometric games and their applications. Pitman, Boston
25. von Stengel B, Werchner R (1997) Complexity of searching an immobile hider in a graph. Discrete Appl Math 78: 235-249
26. Zeliken MI (1972) On a differential game with incomplete information. Sov Math Dokl 13: 228-231