A hide and seek game with traveling cost

A hide and seek game with traveling cost

0.00 Avg rating0 Votes
Article ID: iaor19921069
Country: Japan
Volume: 33
Issue: 2
Start Page Number: 168
End Page Number: 187
Publication Date: Jun 1990
Journal: Journal of the Operations Research Society of Japan
Authors:
Keywords: search
Abstract:

There are n neighboring cells in a straight line. A man hides among one of all cells and stays there. The searcher examines each cell until the hider is found. Associated with the examination by the searcher are a traveling cost dependent on the distance from the last cell examined and a fixed examination cost. The searcher wishes to minimize the expectation of cost of finding the hider. On the other hand the hider wishes to maximize it. This is formulated as a two-person zero-sum game and it is solved.

Reviews

Required fields are marked *. Your email address will not be published.