2000 character limit reached
Selfish Cops and Passive Robber: Qualitative Games
Published 19 Jul 2016 in cs.DM and cs.GT | (1607.05434v2)
Abstract: Several variants of the cops and robbers (CR) game have been studied in the past. In this paper we examine a novel variant, which is played between two cops, each one independently trying to catch a "passive robber". We will call this the Selfish Cops and Passive Robber {SCPR} game. In short, SCPR is a stochastic two-player, zero-sum game where the opponents are the two cop players. We study sequential and concurrent versions of the SCPR game. For both cases we prove the existence of value and optimal strategies and present algorithms for the computation of these.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.