Some results about pursuit games on metric spaces obtained through graph theory techniques (Q1821043)

We introduce a class of discrete pursuit games played on a metric space and we use graph theory techniques in order to characterize those of the situations which allow a victory of the player pursuer. Besides this, we give some equilibrium results, we present some pathological situations, and we conclude by establishing a bridge between our discrete model and the classical continuous models for the pursuit games.