We consider a search problem in which one or more targets must be rescued by a search
party, or Searcher. The targets may be survivors of some natural disaster, or prisoners held …

We study search games between a mobile Searcher and an immobile Hider in which the
Searcher aims to minimize some payoff, which is either the time to find the Hider (the search …

Suppose a target is hidden in one of the vertices of an edge-weighted graph according to a
known probability distribution. Starting from a fixed root node, an expanding search visits the …

We study the classic problem in which a Searcher must locate a hidden point, also called the
Hider in a network, starting from a root point. The network may be either bounded or …

Harry hides on an edge of a graph and does not move from there. Sally, starting from a
known origin, tries to find him as soon as she can. Harry's goal is to be found as late as …

A searcher faces a graph with edge lengths and vertex weights, initially having explored
only a given starting vertex. In each step, the searcher adds an edge to the solution that …

“The king upon his throne, with his crown upon his' ed, can't sit and write his acts of
Parliament in print, without having begun, when he were a unpromoted Prince, with the …

We study two classes of zero-sum stochastic games with compact action sets and a nite
product state space. These two classes assume a communication property on the state …

In this thesis, we develop mathematical models for the optimal deployment of security forces
addressing two main challenges: adaptive behavior of the adversary and uncertainty in the …