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

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 21, Issue 1
Main Authors:	Casares, Antonio, Ohlmann, Pierre
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 24.03.2025 Logical Methods in Computer Science e.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!