Cops and Robbers, Game Theory and Zermelo's Early Results

2014/07/07 by Kehagias, Athanasios, Konstantinidis, Georgios
#Computer Science and Game Theory (cs.GT) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1407.1647

Abstract

We provide a game theoretic framework for the game of cops and robbers (CR). Within this framework we study certain assumptions which underlie the concepts of optimal strategies and capture time. We also point out a connection of these concepts to early work by Zermelo and D. Konig. Finally, we discuss the relationship between CR and related pursuit games to reachability games.

Related

• Simultaneously Moving Cops and Robbers
• The capture time in the game of cops and many robbers
• Fully Active Cops and Robbers
• Some remarks on cops and drunk robbers
• Characterizations and algorithms for generalized Cops and Robbers games