Search and rescue in the face of uncertain threats
From MaRDI portal
Publication:2184077
DOI10.1016/J.EJOR.2020.02.029zbMath1443.91061arXiv1902.05432OpenAlexW3008577512MaRDI QIDQ2184077
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05432
Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (7)
A competitive search game with a moving target ⋮ The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines ⋮ The search and rescue game on a cycle ⋮ Optimal linear tracking for a hidden target on one of \(K\)-intervals ⋮ Search-and-rescue rendezvous ⋮ Time-critical testing and search problems ⋮ A game theoretic approach to a problem in polymatroid maximization
Cites Work
- Unnamed Item
- Sequencing unreliable jobs on parallel machines
- Network search games with immobile hider, without a designated searcher starting point
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- On the approximation ratio of the random Chinese postman tour for network search
- The expanding search ratio of a graph
- Finding a hider by an unknown deadline
- Approximate solutions for expanding search games on general networks
- Search for an immobile hider in a known subset of a network
- Search games on a network with travelling and search costs
- SEARCH GAMES: LITERATURE AND SURVEY
- Search Games with Multiple Hidden Objects
- Search Games on Trees with Asymmetric Travel Times
- Network search games, with arbitrary searcher starting point
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- Sequencing with Series-Parallel Precedence Constraints
- Search Games with Mobile and Immobile Hider
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- On Submodular Search and Machine Scheduling
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
This page was built for publication: Search and rescue in the face of uncertain threats
