ConferencePaper ISI SCOPUS
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  (2024)

Infinite Separation Between General and Chromatic Memory

Kozachinskiy A.

Keywords: Games on graphs, Finite-memory strategies, Chromatic memory

Abstract

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.

Más información

Título según WOS: Infinite Separation Between General and Chromatic Memory
Título según SCOPUS: Infinite Separation Between General and Chromatic Memory
Título de la Revista: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen: 14579
Editorial: Springer Science and Business Media Deutschland GmbH
Fecha de publicación: 2024
Página de inicio: 114
Página final: 128
Idioma: English
DOI:

10.1007/978-3-031-55601-2_8
Notas: ISI, SCOPUS