Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
type: Item
instance of: scholarly article
title: Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
author: James C. A. Main
author: Mickael Randour
published in: Information and Computation
publication date: 2024-12-03T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7953368
zbMATH Keywords: two-player games on graphs
zbMATH Keywords: stochastic games
zbMATH Keywords: Markov decision processes
zbMATH Keywords: finite-memory strategies
zbMATH Keywords: randomised strategies
MaRDI profile type: Publication
cites work: Positional strategies for mean payoff games
cites work: The complexity of stochastic games
cites work: CONCUR 2005 – Concurrency Theory
cites work: Non-Zero Sum Games for Reactive Synthesis
cites work: Graph Games and Reactive Synthesis
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
cites work: Q5015274
cites work: Q5875369
cites work: Average-energy games
cites work: Q5875382
cites work: Strategy synthesis for multi-dimensional quantitative objectives
cites work: The complexity of multi-mean-payoff and multi-energy games
cites work: Percentile queries in multi-dimensional Markov decision processes
cites work: Simple Strategies in Multi-Objective MDPs
cites work: Partial-Observation Stochastic Games: How to Win When Belief Fails
cites work: Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
cites work: Q5150998
cites work: Q3576736
cites work: Q5561633
cites work: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
cites work: Q5028465
cites work: Concurrent reachability games
cites work: Stochastic Games
cites work: Q4464567
cites work: Randomness for free
cites work: Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
cites work: Q4972730
cites work: Q6116057
cites work: Qualitative Determinacy and Decidability of Stochastic Games with Signals
cites work: Trading Infinite Memory for Uniform Randomness in Timed Games
cites work: Random Fruits on the Zielonka Tree
cites work: Reaching Your Goal Optimally by Playing at Random with No Memory
cites work: Probability
cites work: Markov Decision Processes with Multiple Long-run Average Objectives
cites work: Q5278082
cites work: Multi-Objective Model Checking of Markov Decision Processes
cites work: On Stochastic Games with Multiple Objectives
cites work: Approximating Values of Generalized-Reachability Stochastic Games
cites work: Q5240587
DOI: 10.1016/J.IC.2024.105229
description: scientific article; zbMATH DE number 7953368