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)

Two players are lost in a grid of city streets and wish to meet as soon as possible. Knowing only the distribution of the otherâ€™s initial location (two nodes away in one of the four compassâ€¦ (More)

We introduce the notion of a Utilitarian Postman (UP) path on a network Q as one which minimizes the expected time required to find a random (uniformly distributed) point, and show that UP paths mustâ€¦ (More)

This paper analyses a variation of the secretary problem in which two selectors, with different fields of interest, each want to appoint one of the n candidates with as much expertise as possible inâ€¦ (More)

The Galiai theorem states that a noncollinear finite set of points in Euclidean space always has a connecting line containing only two points of the set. This result has provoked considerableâ€¦ (More)

We analyze the optimal behavior of two players who are lost on a planar surface and who want to meet each other in least expected time. They each know the initial distribution of the otherÂ’sâ€¦ (More)