2022/08/04 by Alexander Kozachinskiy, Kozachinskiy, Alexander
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems
paper · pdf · doi:10.48550/arxiv.2208.02691
openalex publication_date 2022/08/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we construct a winning condition W over a finite set of colors such that, first, every finite arena has a strategy with 2 states of general memory which is optimal w.r.t.~W, and second, there exists no k such that every finite arena has a strategy with k states of chromatic memory which is optimal w.r.t.~W.