We show how to optimize the search for a hidden object, terrorist, or simply Hider, located at a pointH according to a known or unknown distribution Î½ on a rooted network Q. We modify the traditionalâ€¦ (More)

We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex such that each edgeâ€¦ (More)

A pipeline network can potentially be attacked at any point and at any time, but such an attack takes a known length of time. To counter this, a Patroller moves around the network at unit speed,â€¦ (More)

We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point H on a network Q moving from a known starting point. Rather than adopting theâ€¦ (More)

We consider a caching game in which a unit amount of infinitely divisible material is distributed among n â‰¥ 2 locations. A Searcher chooses how to distribute his search effort r about the locationsâ€¦ (More)

Patrolling games were recently introduced by Alpern, Morton and Papadaki to model the problem of protecting the nodes of a network from an attack. Time is discrete and in each time unit the Patrollerâ€¦ (More)

We consider a classic search problem first proposed by Gal in which a Searcher randomizes between unit speed paths on a network, aiming to find a hidden point in minimal expected time in the worstâ€¦ (More)