Cops and Robbers, Game Theory and Zermelo's Early Results

Athanasios Kehagias; Georgios Konstantinidis

Cops and Robbers, Game Theory and Zermelo's Early Results

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1407.1647 v1 pith:VZFYIQ6J submitted 2014-07-07 cs.DM cs.GT

Athanasios Kehagias , Georgios Konstantinidis This is my paper · ORCID

classification cs.DMcs.GT

keywords gameconceptscopsearlyframeworkgamesrobberszermelo

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We provide a game theoretic framework for the game of cops and robbers (CR). Within this framework we study certain assumptions which underlie the concepts of optimal strategies and capture time. We also point out a connection of these concepts to early work by Zermelo and D. Konig. Finally, we discuss the relationship between CR and related pursuit games to reachability games.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
cs.DS 2019-08 conditional novelty 6.0 of 10

On edge-periodic graphs, deciding the winner in one-cop-one-robber play takes O(LCM(L) n^3) time, and cycles of length at least 2 l LCM(L) are always robber-win.

Pith tools