Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information

Steve Alpern, Thomas Lidbetter

Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Gal (1979). In this zero-sum game, a Hider picks a point to hide on…