Abstract: Highlights•Search games in a network: pathwise and expanding search.•Exact vs. approximate competitive analysis.•Optimal deterministic expanding search.•Randomized expanding search is hard: approximations.•Improved approximations for pathwise search.