Log In Sign Up

Characterising memory in infinite games

by   Antonio Casares, et al.

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-ordered monotone universal graphs. We extend Ohlmann's characterisation to encompass (finite or infinite) memory upper bounds. We prove that objectives admitting optimal strategies with ε-memory less than m (a memory that cannot be updated when reading an ε-edge) are exactly those which admit well-founded monotone universal graphs whose antichains have size bounded by m. We also give a characterisation of chromatic memory by means of appropriate universal structures. Our results apply to finite as well as infinite memory bounds (for instance, to objectives with finite but unbounded memory, or with countable memory strategies). We illustrate the applicability of our framework by carrying out a few case studies, we provide examples witnessing limitations of our approach, and we discuss general closure properties which follow from our results.


page 3

page 9

page 12

page 13

page 15

page 23

page 37

page 41


Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

We study turn-based quantitative games of infinite duration opposing two...

Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs

We consider zero-sum games on infinite graphs, with objectives specified...

Games Where You Can Play Optimally with Finite Memory

For decades, two-player (antagonistic) games on graphs have been a frame...

Infinite Separation between General and Chromatic Memory

In this note, we answer a question from [Alexander Kozachinskiy. State C...

The Theory of Universal Graphs for Infinite Duration Games

We introduce the notion of universal graphs as a tool for constructing a...

Optimally Resilient Strategies in Pushdown Safety Games

Infinite-duration games with disturbances extend the classical framework...

Extending finite-memory determinacy by Boolean combination of winning conditions

We study finite-memory (FM) determinacy in games on finite graphs, a cen...