HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Arena-Independent Finite-Memory Determinacy in Stochastic Games

Abstract : We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what kinds of strategies are sufficient or required to play optimally (e.g., randomization or memory requirements)? Our contributions further the understanding of arena-independent finite-memory (AIFM) determinacy, i.e., the study of objectives for which memory is needed, but in a way that only depends on limited parameters of the game graphs. First, we show that objectives for which pure AIFM strategies suffice to play optimally also admit pure AIFM subgame perfect strategies. Second, we show that we can reduce the study of objectives for which pure AIFM strategies suffice in two-player stochastic games to the easier study of one-player stochastic games (i.e., Markov decision processes). Third, we characterize the sufficiency of AIFM strategies through two intuitive properties of objectives. This work extends a line of research started on deterministic games in [BLO+20] to stochastic ones. [BLO+20] Patricia Bouyer, St\'ephane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR 2020.
Complete list of metadata

Contributor : Patricia Bouyer Connect in order to contact the contributor
Submitted on : Thursday, May 27, 2021 - 9:06:47 PM
Last modification on : Saturday, January 29, 2022 - 3:34:45 AM

Links full text



Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove. Arena-Independent Finite-Memory Determinacy in Stochastic Games. CONCUR'21, Aug 2021, Paris, France. ⟨10.4230/LIPIcs.CONCUR.2021.26⟩. ⟨hal-03240080⟩



Record views