A survey on the relationship between the game of cops and robbers and other game representations
From MaRDI portal
Publication:2280205
DOI10.1007/s13235-018-0275-5zbMath1429.91065OpenAlexW2886055007MaRDI QIDQ2280205
Publication date: 18 December 2019
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-018-0275-5
Games involving graphs (91A43) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (5)
On stability of economic networks ⋮ Cops and robber game on infinite chessboard ⋮ Unnamed Item ⋮ Some game-theoretic remarks on two-player generalized cops and robbers games ⋮ On a contraction-like property of dismantlable graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneously moving cops and robbers
- Characterizations of \(k\)-copwin graphs
- Cops and robbers ordinals of cop-win trees
- Selfish cops and passive robber: qualitative games
- Cops and robbers from a distance
- A game of cops and robbers
- Note on a pursuit game played on graphs
- Trees and decisions
- Equilibrium existence for large perfect information games
- The role of information in the cop-robber game
- Trees and extensive forms
- A short note about pursuit games played on a graph with a given genus
- Cops and robbers in graphs with large girth and Cayley graphs
- On a pursuit game played on graphs for which a minor is excluded
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Gibbs measures and dismantlable graphs
- A game of cops and robbers played on products of graphs
- On a characterization of evasion strategies for pursuit-evasion games on graphs
- Vertex-to-vertex pursuit in a graph
- Revolutionaries and spies: spy-good and spy-bad graphs
- Large extensive form games
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Tandem-win graphs
- Vertex-Pursuit in Random Directed Acyclic Graphs
- Cop and Robber Games When the Robber Can Hide and Ride
- Infinite Games
- Characterizations and algorithms for generalized Cops and Robbers games
- Revolutionaries and Spies on Random Graphs
- Graph Searching Games and Probabilistic Methods
- A Tandem version of the Cops and Robber Game played on products of graphs
This page was built for publication: A survey on the relationship between the game of cops and robbers and other game representations
