A remark on a helicopter and submarine game

Andrej Y U. Garnaev

Naval Research Logistics (NRL), 1993, vol. 40, issue 5, 745-753

Abstract: The article considers a two‐person zero‐sum game in which the movement of the players is constrained to integer points …, −1, 0, 1, … of a line L. Initially the searcher (hider) is at point x = 0 (x = d, d > 0). The searcher and the hider perform simple motion on L with maximum speeds w and u, respectively, where w > u > 0. Each of the players knows the other's initial position but not the other's subsequent positions. The searcher has a bomb which he can drop at any time during his search. Between the dropping of the bomb and the bomb exploding there is a T time lag. If the bomb explodes at point i and the hider is at point i − 1, or i, or i + 1, then the destruction probability is equal to P, or 1, or P, respectively, where 0

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199308)40:53.0.CO;2-1

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:40:y:1993:i:5:p:745-753

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 ().