Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1999)
“A solution for a two-person zero-sum game with a concave payoff function,”
Research Logistics
F. Dambreville, J. Cadre (2002)
Search game for a moving target with dynamically generated informationsProceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997), 1
(1964)
“A sequentially compounded search game,”
Ryusuke Hohzaki (2006)
Search allocation gameEur. J. Oper. Res., 172
P. Deitz, Michael Starks (1999)
The Generation, Use, and Misuse of "PKs" in Vulnerability/Lethality AnalysesMilitary Operations Research, 4
K. Kikuta (1991)
A SEARCH GAME WITH TRAVELING COSTJournal of The Operations Research Society of Japan, 34
V. Baston, F. Bostock (1989)
A one-dimensional helicopter-submarine gameNaval Research Logistics, 36
Teruhisa Nakai (1988)
SEARCH MODELS WITH CONTINUOUS EFFORT UNDER VARIOUS CRITERIAJournal of The Operations Research Society of Japan, 31
Teruhisa Nakai (1986)
A SEQUENTIAL EVASION-SEARCH GAME WITH A GOALJournal of The Operations Research Society of Japan, 29
Ryusuke Hohzaki, K. Iida (1998)
A SEARCH GAME WITH REWARD CRITERIONJournal of The Operations Research Society of Japan, 41
K. Kikuta (1990)
A HIDE AND SEEK GAME WITH TRAVELING COSTJournal of The Operations Research Society of Japan, 33
Ryusuke Hohzaki, A. Washburn (2003)
AN APPROXIMATION FOR A CONTINUOUS DATUM SEARCH GAME WITH ENERGY CONSTRAINTJournal of The Operations Research Society of Japan, 46
A. Garnaev (1993)
A remark on a helicopter and submarine gameNaval Research Logistics, 40
A. Washburn (1980)
Search-Evasion Game in a Fixed RegionOper. Res., 28
(1980)
Search and screening
K. Iida, Ryusuke Hohzaki, S. Furui (1996)
A SEARCH GAME FOR A MOBILE TARGET WITH THE CONDITIONALLY DETERMINISTIC MOTION DEFINED BY PATHSJournal of The Operations Research Society of Japan, 39
Ryusuke Hohzaki, A. Washburn (2001)
The Diesel Submarine Flaming Datum ProblemMilitary Operations Research, 6
F. Dambreville, J. Cadre (2002)
Detection of a Markovian target with optimization of the search efforts under generalized linear constraintsNaval Research Logistics (NRL), 49
J. Danskin (1968)
A Helicopter Versus Submarine Search GameOper. Res., 16
Ryusuke Hohzaki, K. Iida, Toru Komiya (2002)
DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTSJournal of The Operations Research Society of Japan, 45
James Eagle, A. Washburn (1991)
Cumulative search‐evasion gamesNaval Research Logistics, 38
K. Iida, Ryusuke Hohzaki, Kenjyo Sato (1994)
HIDE-AND-SEAERCH GAME WITH THE RISK CRITERIONJournal of The Operations Research Society of Japan, 37
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
Naval Research Logistics: An International Journal – Wiley
Published: Feb 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.