A search game taking account of attributes of searching resources

Ryusuke Hohzaki

Naval Research Logistics (NRL), 2008, vol. 55, issue 1, 76-90

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

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20269

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:55:y:2008:i:1:p:76-90

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().