Selfish cops and passive robber: qualitative games
From MaRDI portal
Publication:529065
DOI10.1016/j.tcs.2017.04.004zbMath1371.91024arXiv1607.05434OpenAlexW2963960595MaRDI QIDQ529065
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
2-person games (91A05) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
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 ⋮ Generalized cops and robbers: a multi-player pursuit game on graphs ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneously moving cops and robbers
- Cops and invisible robbers: the cost of drunkenness
- Capturing the drunk robber on a graph
- A survey of stochastic \(\omega \)-regular games
- Positional strategies for mean payoff games
- Infinite games played on finite graphs
- On the cop number of a graph
- Vertex-to-vertex pursuit in a graph
- Some remarks on cops and drunk robbers
- Deterministic graphical games
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Concurrent reachability games
- Infinite Deterministic Graphical Games
- Infinite Games
- Characterizations and algorithms for generalized Cops and Robbers games
- Computer Science Logic
- Stochastic Games
This page was built for publication: Selfish cops and passive robber: qualitative games