Characterising memory in infinite games

This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an objective is positional if and only if it admits well-or...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 21, Issue 1
Hauptverfasser:	Casares, Antonio, Ohlmann, Pierre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 24.03.2025 Logical Methods in Computer Science e.V
Schlagworte:	Computer Science computer science - formal languages and automata theory computer science - logic in computer science Universal graphs Infinite duration games Memory
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!