Finding a hider by an unknown deadline

DOI10.1016/j.orl.2015.11.003zbMath1408.90145OpenAlexW2179383844MaRDI QIDQ1785459

Dashi I. Singham, Kyle Y. Lin

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.11.003

zbMATH Keywords

search theorytwo-person zero-sum gamerobust strategy

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05)

Related Items (7)

Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Time-critical testing and search problems ⋮ Searching for multiple objects in multiple locations ⋮ Unnamed Item ⋮ A normal form game model of search and pursuit

Cites Work

• Optimal discrete search with imperfect specificity
• The theory of search games and rendezvous.
• Discrete search and the Neyman-Pearson lemma
• The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities
• A hide–search game
• The search for an intelligent evader concealed in one of an arbitrary number of regions
• The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
• Search Theory
• A Periodic Optimal Search
• A Sequential Search Procedure
• A Problem in Optimal Search and Stop
• Optimal Whereabouts Search
• Optimal Stopping in a Discrete Search Problem

This page was built for publication: Finding a hider by an unknown deadline