Cops and robber with decoys

Authors

  • Nancy E. Clarke Acadia University
  • Davita DesRoches Acadia University
  • Jim Diamond Acadia University
  • Moinul Islam Acadia University

DOI:

https://doi.org/10.55016/dn6kj166

Abstract

We introduce a variation of the Cops and Robber game in which the robber side consists of a robber and a decoy which are indistinguishable to the cops except under certain conditions. The cops win when one of them moves onto the same vertex as the actual robber (i.e.~not the decoy) after a finite number of turns. The robber can throw the decoy to a neighbouring vertex on any turn beyond his first; such a turn for the robber consists of throwing (or dropping) the decoy and then moving. The current decoy disappears as the next is thrown so there is only a single decoy in play at any time. We characterize decoy-copwin graphs in the case where the cop can distinguish between the robber and decoy only when he is on the same vertex as one of them. We also characterize such graphs if the cop can distinguish between the robber and decoy only when he has cornered at least one of them.

Downloads

Published

2026-02-27

Issue

Section

Articles