Broadcasting Agents and Adversary: A new variation on Cops and Robbers
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914387765231616 |
|---|---|
| author | Moses Jr., William K. Redlich, Amanda Stock, Frederick |
| author_facet | Moses Jr., William K. Redlich, Amanda Stock, Frederick |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_11958 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Broadcasting Agents and Adversary: A new variation on Cops and Robbers Moses Jr., William K. Redlich, Amanda Stock, Frederick Combinatorics 05C57, 05C75, 05C85 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. |
| title | Broadcasting Agents and Adversary: A new variation on Cops and Robbers |
| topic | Combinatorics 05C57, 05C75, 05C85 |
| url | https://arxiv.org/abs/2603.11958 |