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
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
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- A survey on the relationship between the game of cops and robbers and other game representations
- Some game-theoretic remarks on two-player generalized cops and robbers games
- Cops and robber game without recharging
- Simultaneously moving cops and robbers
2-person games (91A05) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Stochastic Games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Infinite Games
- Title not available (Why is that?)
- On the cop number of a graph
- Vertex-to-vertex pursuit in a graph
- Some remarks on cops and drunk robbers
- A note on \(k\)-cop, \(l\)-robber games on graphs
- The game of cops and robbers on graphs
- Title not available (Why is that?)
- A course in game theory.
- A survey of stochastic \(\omega \)-regular games
- Concurrent reachability games
- Title not available (Why is that?)
- Positional strategies for mean payoff games
- Simultaneously moving cops and robbers
- Cops and invisible robbers: the cost of drunkenness
- Characterizations and algorithms for generalized Cops and Robbers games
- Computer Science Logic
- Infinite games played on finite graphs
- Deterministic graphical games
- Capturing the drunk robber on a graph
- Infinite Deterministic Graphical Games
Cited In (5)
- Title not available (Why is that?)
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- Generalized cops and robbers: a multi-player pursuit game on graphs
- Some game-theoretic remarks on two-player generalized cops and robbers games
- A survey on the relationship between the game of cops and robbers and other game representations
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)