Selfish cops and passive robber: qualitative games

From MaRDI portal
Publication:529065

DOI10.1016/J.TCS.2017.04.004zbMATH Open1371.91024arXiv1607.05434OpenAlexW2963960595MaRDI QIDQ529065FDOQ529065


Authors: Yong-Cai Geng, Sumit K. Garg Edit this on Wikidata


Publication date: 18 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1607.05434




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Selfish cops and passive robber: qualitative games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529065)