Selfish cops and passive robber: qualitative games

DOI10.1016/J.TCS.2017.04.004MaRDI QIDQ529065zbMATHOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 18 May 2017

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

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

zbMATH Keywords

game theorycops and robberspursuit-evasion game

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

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.

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

Cites work

• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 5145315 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 3245077 (Why is no real title available?)
• A course in game theory.
• A note on \(k\)-cop, \(l\)-robber games on graphs
• A survey of stochastic \(\omega \)-regular games
• Capturing the drunk robber on a graph
• Characterizations and algorithms for generalized cops and robbers games
• Computer Science Logic
• Concurrent reachability games
• Cops and invisible robbers: the cost of drunkenness
• Deterministic graphical games
• Infinite Deterministic Graphical Games
• Infinite Games
• Infinite games played on finite graphs
• On the cop number of a graph
• Positional strategies for mean payoff games
• Simultaneously moving cops and robbers
• Some remarks on cops and drunk robbers
• Stochastic Games
• The game of cops and robbers on graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(5)

• Generalized cops and robbers: a multi-player pursuit game on graphs
• A survey on the relationship between the game of cops and robbers and other game representations
• Selfish cops and active robber: multi-player pursuit evasion on graphs
• Some game-theoretic remarks on two-player generalized cops and robbers games
• scientific article; zbMATH DE number 1270376 (Why is no real title available?)

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)