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...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 21, Issue 1
Hlavní autoři:	Casares, Antonio, Ohlmann, Pierre
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 24.03.2025 Logical Methods in Computer Science e.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!