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

TL;DR
This paper explores how the complexity of strategies in one-player games can inform the complexity in two-player games, establishing conditions under which finite memory strategies in one-player games imply similar strategies in two-player games.
Contribution
It extends the concept of one-to-two-player lifting to memory complexity, identifying when finite or infinite memory strategies transfer from one-player to two-player games.
Findings
Finite memory in one-player games implies finite memory in two-player games if complexity is sublinear.
Linear memory complexity in one-player games can lead to infinite memory in two-player games.
The paper establishes the exact boundary for lifting theorems based on memory complexity.
Abstract
We investigate a phenomenon of "one-to-two-player lifting" in infinite-duration two-player games on graphs with zero-sum objectives. More specifically, let be a class of strategies. It turns out that in many cases, to show that all two-player games on graphs with a given payoff function are determined in , it is sufficient to do so for one-player games. That is, in many cases the determinacy in can be "lifted" from one-player games to two-player games. Namely, Gimbert and Zielonka~(CONCUR 2005) have shown this for the class of positional strategies. Recently, Bouyer et al. (CONCUR 2020) have extended this to the classes of arena-independent finite-memory strategies. Informally, these are finite-memory strategies that use the same way of storing memory in all game graphs. In this paper, we put the lifting technique into the context of memory complexity. The memory complexity…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
