Article ID: | iaor1995620 |
Country: | United States |
Volume: | 41 |
Issue: | 6 |
Start Page Number: | 821 |
End Page Number: | 831 |
Publication Date: | Oct 1994 |
Journal: | Naval Research Logistics |
Authors: | Kikuta Kensaku, Ruckle William H. |
Keywords: | search |
An initial point search game on a weighted graph involves a searcher who wants to minimize search and travel costs seeking a hider who wants to maximize these costs. The searcher starts from a specified vertex 0 and searches each vertex in some order. The hider chooses a nonzero vertex and remains there. The authors solve the game in which the graph is a simple tree, and use this solution to solve a search game on a tree in which each branch is itself a weighted graph with a certain property, and the searcher is obliged to search the entire branch before departing.