Broadcasting Agents and Adversary: A new variation on Cops and Robbers
Abstract
We introduce a new game played on graphs, ``Agents and Adversary". This game is reminiscent of ``Cops and Robbers" but has some fundamental differences. We classify infinite families of graphs as Agents-win and Adversary-win. We then define a new type of graph symmetry and use it to define a winning strategy for Adversary. Finally, we give tight upper and lower bounds for Agents' time-to-win on several infinite families of graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.