A search game taking account of attributes of searching resources |
| |
Authors: | Ryusuke Hohzaki |
| |
Affiliation: | Department of Computer Science, National Defense Academy, Hashirimizu, Yokosuka 239‐8686, Japan |
| |
Abstract: | This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 |
| |
Keywords: | search game game theory two‐person zero‐sum game search allocation game linear programming |
|
|