Search for an infiltrator

Ljiljana Pavlovic

Naval Research Logistics (NRL), 1995, vol. 42, issue 1, 15-26

Abstract: We have solved a discrete search game on an array of n ordered cells for n ⩽ 9, with two players: infiltrator (hider) and searcher, who have opposite goals. The infiltrator wishes to reach the last cell number n (in finite time) and the searcher has to defend that cell. The payoff (to the hider) is the probability that the hider wins, that is, reaches the last cell without getting captured. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199502)42:13.0.CO;2-P

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:42:y:1995:i:1:p:15-26

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