Finding a hider by an unknown deadline
type: Item
instance of: scholarly article
title: Finding a hider by an unknown deadline
zbMATH Open document ID: 1408.90145
author: Kyle Y. Lin
author: Dashi I. Singham
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 6945432
zbMATH Keywords: search theory
zbMATH Keywords: two-person zero-sum game
zbMATH Keywords: robust strategy
MaRDI profile type: Publication
full work available at URL: j.orl.2015.11.003
OpenAlex ID: W2179383844
cites work: Search Theory
cites work: The theory of search games and rendezvous.
cites work: A Sequential Search Procedure
cites work: Optimal Stopping in a Discrete Search Problem
cites work: The search for an intelligent evader concealed in one of an arbitrary number of regions
cites work: Discrete search and the Neyman-Pearson lemma
cites work: Optimal Whereabouts Search
cites work: Optimal discrete search with imperfect specificity
cites work: A Periodic Optimal Search
cites work: The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
cites work: A Problem in Optimal Search and Stop
cites work: A hide–search game
cites work: The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities
DOI: 10.1016/J.ORL.2015.11.003
description: scientific article; zbMATH DE number 6945432