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

01/26/2022
by   James C. A. Main, et al.
0

Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently probabilistic goals, balancing multiple objectives, or in contexts of partial information. There is no unique way to define randomised strategies. For instance, one can use so-called mixed strategies or behavioural ones. In the most general settings, these two classes do not share the same expressiveness. A seminal result in game theory - Kuhn's theorem - asserts their equivalence in games of perfect recall. This result crucially relies on the possibility for strategies to use infinite memory, i.e., unlimited knowledge of all the past of a play. However, computer systems are finite in practice. Hence it is pertinent to restrict our attention to finite-memory strategies, defined as automata with outputs. Randomisation can be implemented in these in different ways: the initialisation, outputs or transitions can be randomised or deterministic respectively. Depending on which aspects are randomised, the expressiveness of the corresponding class of finite-memory strategies differs. In this work, we study two-player turn-based stochastic games and provide a complete taxonomy of the classes of finite-memory strategies obtained by varying which of the three aforementioned components are randomised. Our taxonomy holds both in settings of perfect and imperfect information.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2020

Games Where You Can Play Optimally with Finite Memory

For decades, two-player (antagonistic) games on graphs have been a frame...
research
02/19/2021

Arena-Independent Finite-Memory Determinacy in Stochastic Games

We study stochastic zero-sum games on graphs, which are prevalent tools ...
research
04/28/2021

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

We investigate so-called "one-to-two-player lifting" theorems for infini...
research
02/08/2023

Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge

In this paper, we extend the Descent framework, which enables learning a...
research
02/25/2022

Stochastic Games with Synchronizing Objectives

We consider two-player stochastic games played on a finite graph for inf...
research
06/26/2020

Kuhn's Equivalence Theorem for Games in Intrinsic Form

We state and prove Kuhn's equivalence theorem for a new representation o...
research
07/11/2019

Time-aware uniformization of winning strategies

Two-player win/lose games of infinite duration are involved in several d...

Please sign up or login with your details

Forgot password? Click here to reset