Search Games for an Immobile Hider

DOI10.1007/978-1-4614-6825-7_2zbMath1356.91021OpenAlexW144960222MaRDI QIDQ2961391

Thomas F. 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

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

Approximate solutions for expanding search games on general networks ⋮ Search for an immobile hider in a known subset of a network

Cites Work

• Unnamed Item
• Unnamed Item
• Network search games with immobile hider, without a designated searcher starting point
• Search games
• On the optimality of a simple strategy for searching graphs
• The theory of search games and rendezvous.
• \(\Gamma\)-component additive games
• Search games with immobile hider
• On the linear search problem
• Find-and-Fetch Search on a Tree
• Search Games on Trees with Asymmetric Travel Times
• Network search games, with arbitrary searcher starting point
• Search Games with Mobile and Immobile Hider
• Searching a Variable Speed Network
• Mining Coal or Finding Terrorists: The Expanding Search Paradigm

This page was built for publication: Search Games for an Immobile Hider