scientific article; zbMATH DE number 7730628

DOI10.4230/lipics.concur.2021.26arXiv2102.10104MaRDI QIDQ6134270

Youssouf Oualhadj, Pierre Vandenhove, Patricia Bouyer, Mickael Randour

Publication date: 21 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.10104

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov decision processesstochastic gamesoptimal strategiesfinite-memory determinacytwo-player games on graphs

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer science (68-XX)

Related Items

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of stochastic \(\omega \)-regular games
• The complexity of stochastic Müller games
• First-cycle games
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Exploring the boundary of half-positionality
• Positional strategies for mean payoff games
• The complexity of stochastic games
• Borel determinacy
• Extending finite-memory determinacy to multi-player games
• Energy parity games
• Stochastic games with lexicographic reachability-safety objectives
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
• Strategy synthesis for multi-dimensional quantitative objectives
• The complexity of multi-mean-payoff and multi-energy games
• Average-energy games
• On Stochastic Games with Multiple Objectives
• One-Counter Stochastic Games
• Playing Stochastic Games Precisely
• Playing Safe
• Bounding Average-Energy Games
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Randomness for Free
• Pure Stationary Optimal Strategies in Markov Decision Processes
• Half-Positional Determinacy of Infinite Games
• Probability
• Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives
• Simple Strategies in Multi-Objective MDPs
• Reaching Your Goal Optimally by Playing at Random with No Memory
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
• Variations on the Stochastic Shortest Path Problem
• Random Fruits on the Zielonka Tree
• Church’s Problem and a Tour through Automata Theory
• Generalized Parity Games
• Stochastic Games
• Combinations of Qualitative Winning for Stochastic Parity Games
• Percentile queries in multi-dimensional Markov decision processes
• CONCUR 2005 – Concurrency Theory