Searching for searchers
Colin L. Mallows, Jean Meloche · Journal of Applied Probability · 2006
We describe a search problem that has arisen in the context of network monitoring. Abstractly, a known (very large) region may contain one or more ‘agents’. Starting with just one agent, we search until another agent is found; this new agent can assist in the remaining search, and so on recursively.