Some results about pursuit games on metric spaces obtained through graph theory techniques (Q1821043): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:45, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some results about pursuit games on metric spaces obtained through graph theory techniques |
scientific article |
Statements
Some results about pursuit games on metric spaces obtained through graph theory techniques (English)
0 references
1986
0 references
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.
0 references
graph
0 references
discrete pursuit games
0 references
metric space
0 references