We analyze the hide-and-seek game (G) on certain networksG. The hider picks a hiding point y inG and the searcher picks a unit speed path S(t ) inG, starting at any point S(0). The payoff in thisâ€¦ (More)

In the (zero-sum) search game (G; x) proposed by Isaacs, the Hider picks a point H in the network G and the Searcher picks a unit speed path S (t) in G with S (0) = x: The payoÂ¤ to the maximizingâ€¦ (More)

Scatter hoarders are animals (e.g. squirrels) who cache food (nuts) over a number of sites for later collection. A certain minimum amount of food must be recovered, possibly after pilfering byâ€¦ (More)

We call a network partly Eulerian if consists of a tree (of length a and radius r) to which a Â…nite number of disjoint Eulerian networks (of total length b) are attached, each at a single point. Weâ€¦ (More)

Two players are independently placed on a commonly labelled network X: They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which theyâ€¦ (More)

We advance and apply the mathematical theory of search games to model the problem faced by a predator searching for prey. Two search modes are available: ambush and cruising search. Some species canâ€¦ (More)