Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information: The Value Is 2qμ + (p − q)D, Attained by the Recursive Hider Distribution and the Favoring-Bias SearcherResearch Paper
Search games model a Searcher looking for an object or a person whose location is chosen adversarially: a lost hiker, a mine, a hidden explosive device, a fugitive. In the classic search game on a tree, a Hider stands still at a point of a tree network, and a Searcher starts from the root and moves at unit speed. The payoff is the time to find the Hider. Gal…