One-to-Two-Player Lifting for Mildly Growing Memory

by   Alexander Kozachinskiy, et al.

We investigate so-called "one-to-two-player lifting" theorems for infinite-duration two-player games on graphs with zero-sum objectives. These theorems are concerned with questions of the following form. If that much memory is sufficient to play optimally in one-player games, then how much memory is needed to play optimally in two-player games? In 2005, Gimbert and Zielonka (CONCUR 2005) have shown that if no memory is needed in the one-player games, then the same holds for the two-player games. Building upon their work, Bouyer et al. (CONCUR 2020) have shown that if some constant amount of memory (independent of the size of a game graph) is sufficient in the one-player games, then exactly the same constant is sufficient in the two-player games. They also provide an example in which every one-player game requires only a finite amount of memory (now this amount depends on the size of a game) while some two-player game requires infinite memory. Our main result states the following. If the memory grows just a bit slower (in the one-player games) than in the example of Bouyer et al., then in every two-player game it is sufficient to have finite memory. Thus, our work identifies the exact barrier for the one-to-two-player lifting theorems in a context of finite-memory strategies.


page 1

page 2

page 3

page 4


Arena-Independent Finite-Memory Determinacy in Stochastic Games

We study stochastic zero-sum games on graphs, which are prevalent tools ...

Spatial Parrondo games with spatially dependent game A

Parrondo games with spatial dependence were introduced by Toral (2001) a...

Bidding combinatorial games

Combinatorial Game Theory is a branch of mathematics and theoretical com...

Parameterized Games and Parameterized Automata

We introduce a way to parameterize automata and games on finite graphs w...

Rapid Prediction of Player Retention in Free-to-Play Mobile Games

Predicting and improving player retention is crucial to the success of m...

State Complexity of Chromatic Memory in Infinite-Duration Games

A major open problem in the area of infinite-duration games is to charac...

Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions

Two-player (antagonistic) games on (possibly stochastic) graphs are a pr...

Please sign up or login with your details

Forgot password? Click here to reset