Wednesday, Oct 17, 2018    | 10:30am-12:00am | Room 335, HSBC Business School Building

Abstract

We consider the class of pursuit-evasion games played on undirected graphs, originally studied by Nowakowski and Winkler (1983). For this class of games, when the initial conditions are chosen by Nature, we give a characterization of evasion strategies for games with one evader and any finite number of pursuers. When the game is played on digraphs, we find that the characterization results no longer hold. We then give two new results that characterize evasion and pursuit strategies for pursuit-evasion games on digraphs. We finally discuss the more general case of n-ary relations.