Search games for an immobile hider
From MaRDI portal
Publication:2961391
DOI10.1007/978-1-4614-6825-7_2zbMATH Open1356.91021OpenAlexW144960222MaRDI QIDQ2961391FDOQ2961391
Authors: Thomas Lidbetter 
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_2
Recommendations
Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- The theory of search games and rendezvous.
- Find-and-fetch search on a tree
- Search Games with Mobile and Immobile Hider
- Search games
- Network search games with immobile hider, without a designated searcher starting point
- Mining coal or finding terrorists: the expanding search paradigm
- On the linear search problem
- Network search games, with arbitrary searcher starting point
- \(\Gamma\)-component additive games
- On the optimality of a simple strategy for searching graphs
- Search games with immobile hider
- Search games on trees with asymmetric travel times
- Title not available (Why is that?)
- Searching a variable speed network
Cited In (9)
- Search for an immobile hider on a stochastic network
- Search for an immobile hider in a known subset of a network
- Search games: a review
- The theory of search games and rendezvous.
- Network search games with immobile hider, without a designated searcher starting point
- Approximate solutions for expanding search games on general networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- The search value of a set
This page was built for publication: Search games for an immobile hider
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961391)
