Some Results about Pursuit Games on Metric Spaces Obtained Through Graph Theory Techniques

In this paper 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.