General cops and robbers games with randomness
From MaRDI portal
Publication:820532
Recommendations
- 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
- Cops and robber game without recharging
- Characterizations and algorithms for generalized cops and robbers games
- Some remarks on cops and drunk robbers
Cites work
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 1973375 (Why is no real title available?)
- scientific article; zbMATH DE number 6180528 (Why is no real title available?)
- A course in game theory.
- A game of cops and robbers
- A note on \(k\)-cop, \(l\)-robber games on graphs
- A probabilistic version of the game of zombies and survivors on graphs
- An annotated bibliography on guaranteed graph searching
- Capturing the drunk robber on a graph
- Characterizations and algorithms for generalized cops and robbers games
- Characterizations of \(k\)-copwin graphs
- Cop and robber games when the robber can hide and ride
- Cops and robbers is EXPTIME-complete
- Fibonacci heaps and their uses in improved network optimization algorithms
- On Markov games
- Pursuing a fast robber on a graph
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve
- Some remarks on cops and drunk robbers
- Stochastic Games
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- The complexity of stochastic games
- The game of cops and robbers on graphs
- Vertex-to-vertex pursuit in a graph
This page was built for publication: General cops and robbers games with randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820532)
