This article surveys the area of search games with immobile and mobile hider. The search
space is either a graph, a bounded domain or an unbounded set. The search process is …

This article surveys recent advancements in strategy designs for persistent robotic
surveillance tasks, with a focus on stochastic approaches. The problem describes how …

This book is unusual among books on game theory in considering only the special case
where there are exactly two players whose interests are completely opposed—the two …

The purpose of this paper is to review literature published to date on search games, almost
all of which have originated from search theory. Search theory itself is a research field of …

A new game theoretical approach is proposed to build near-optimal solutions of the social
planner in the context of economics. In this regard, one target two-player pursuit-evasion …

SCENARIOS where dynamic agents are engaged in pursuit and evasion are correctly
analyzed in the framework of dynamic games [1–4]. Approaches based on dynamic Voronoi …

We present analytic results for mean capture time and energy expended by a pack of
deterministic hounds actively chasing a randomly diffusing prey. Depending on the number …

A point H is hidden in a rooted tree Q which is endowed with asymmetric distances (travel
times) between nodes. We determine the randomized search strategy, starting from the root …

A recent stochastic pursuit model describes a pack of chasers (hounds) that actively move
toward a target (hare) that undergoes pure Brownian diffusion (Bernardi and Lindner 2022 …

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 …