The role of information in the cop-robber game
From MaRDI portal
Publication:930890
DOI10.1016/j.tcs.2008.02.041zbMath1151.91375OpenAlexW2167937316MaRDI QIDQ930890
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.041
Related Items
Image feedback based optimal control and the value of information in a differential game ⋮ The lion and man game on polyhedral surfaces with obstacles ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas ⋮ Solving zero-sum one-sided partially observable stochastic games ⋮ Formulation of a cooperative-confinement-escape problem of multiple cooperative defenders against an evader escaping from a circular region ⋮ Collaborative pursuit-evasion strategy of UAV/UGV heterogeneous system in complex three-dimensional polygonal environment ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4 ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ Pursuit of a Moving Target with Known Constant Speed on a Directed Acyclic Graph under Partial Information ⋮ A pursuit-evasion game between two identical differential drive robots ⋮ Probabilistic pursuits on graphs ⋮ Zero-visibility cops and robber and the pathwidth of a graph ⋮ A game of surveillance between an omnidirectional agent and a differential drive robot
Cites Work
- The complexity of pursuit on a graph
- A game of cops and robbers
- The vertex separation and search number of a graph
- Gibbs measures and dismantlable graphs
- A game of cops and robbers played on products of graphs
- Vertex-to-vertex pursuit in a graph
- On cop-win graphs
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Randomized Pursuit-Evasion with Local Visibility
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
