We show how to optimize the search for a hidden object, terrorist, or simply Hider, located at
a point H according to a known or unknown distribution ν on a rooted network Q. We modify …

Consider a two-person zero-sum search game between a hider and a searcher. The hider
hides among n discrete locations, and the searcher successively visits individual locations …

In this paper we extend the framework of the evolutionary inspection game put forward
recently by the author and coworkers to a large class of conflict interactions to address the …

Suppose that some objects are hidden in a finite set S of hiding places that must be
examined one by one. The cost of searching subsets of S is given by a submodular function …

The authors analyse two-person zero-sum search games in which play takes place on a
network and in discrete time. The hider first chooses a node and remains there for the …

We present efficient algorithms for computing optimal or approximately optimal strategies in
a zero-sum game for which player I has n pure strategies and player II has an arbitrary …

Adversarial search of a network for an immobile Hider (or target) was introduced and solved
for rooted trees by Shmuel Gal in 1979. In this zero-sum game, a Hider picks a point to hide …

A Searcher seeks to find a stationary Hider located at some point H (not necessarily a node)
on a given network Q. The Searcher can move along the network from a given starting point …

This paper introduces a new search paradigm to hide-and-seek games on networks. The
Hider locates at any point on any arc. The Searcher adopts a “combinatorial” path when …

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 …