Cops against a cheating robber
Nancy E. Clarke, Danny Dyer, William Kellough

TL;DR
This paper introduces the 'cheating robot' variation of Cops and Robbers, defines the push number parameter, and explores the cheating robot number across different graph classes, providing bounds and computational complexity results.
Contribution
It introduces the push number parameter and analyzes the cheating robot number for various graph classes, including planar and bipartite graphs, with complexity results.
Findings
The push number relates to the cheating robot number and helps analyze cop strategies.
Bounded the cheating robot number for bipartite planar graphs.
Determined polynomial-time decision procedures for fixed k.
Abstract
We investigate a cheating robot version of Cops and Robber, first introduced by Huggan and Nowakowski, where both the cops and the robber move simultaneously, but the robber is allowed to react to the cops' moves. For conciseness, we refer to this game as Cops and Cheating Robot. The cheating robot number for a graph is the fewest number of cops needed to win on the graph. We introduce a new parameter for this variation, called the push number, which gives the value for the minimum number of cops that move onto the robber's vertex given that there are a cheating robot number of cops on the graph. After producing some elementary results on the push number, we use it to give a relationship between Cops and Cheating Robot and Surrounding Cops and Robbers. We investigate the cheating robot number for planar graphs and give a tight bound for bipartite planar graphs. We show that determining…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAcademic integrity and plagiarism
