Probabilistically Faulty Searching on a Half-Line

Anthony Bonato, Konstantinos Georgiou, Calum MacRury +1

We study $p$-Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or $1$-ray) for a hidden item. The searcher is…