Cop vs. gambler

DOI10.1016/j.disc.2016.01.015zbMath1333.05201arXiv1308.4715OpenAlexW1588159073MaRDI QIDQ267177

Natasha Komarov, Peter M. Winkler

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.4715

zbMATH Keywords

cops and robberspursuit/evasion games

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Locating a robber with multiple probes

Cites Work

• Unnamed Item
• Unnamed Item
• The capture time of a graph
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Hunter, Cauchy rabbit, and optimal Kakeya sets
• Maximum hitting time for random walks on graphs
• Search Games with Mobile and Immobile Hider
• Randomized Pursuit-Evasion in Graphs

This page was built for publication: Cop vs. gambler