Some remarks on cops and drunk robbers
From MaRDI portal
Publication:1929226
DOI10.1016/j.tcs.2012.08.016zbMath1258.91042OpenAlexW2963612420MaRDI QIDQ1929226
Paweł Prałat, Athanasios Kehagias
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.016
Related Items (13)
General cops and robbers games with randomness ⋮ Simultaneously moving cops and robbers ⋮ A probabilistic version of the game of zombies and survivors on graphs ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Lazy Cops and Robbers on Hypercubes ⋮ The capture time of the hypercube ⋮ Selfish cops and passive robber: qualitative games ⋮ Burning graphs: a probabilistic perspective ⋮ Zero-visibility cops and robber and the pathwidth of a graph ⋮ Containment game played on random graphs: another zig-zag theorem ⋮ Chasing a drunk robber in many classes of graphs ⋮ A game theoretic analysis of the cops and robber game
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneously moving cops and robbers
- The capture time of grids
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- Cops and robbers in graphs with large girth and Cayley graphs
- Optimal control of diffusion processes with reflection
- A game of cops and robbers played on products of graphs
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Meyniel's conjecture holds for random graphs
- Chasing robbers on random graphs: Zigzag theorem
- Pursuit-Evasion in Models of Complex Networks
- Collisions Among Random Walks on a Graph
- A Survey of Applications of Markov Decision Processes
This page was built for publication: Some remarks on cops and drunk robbers
