Combinations of Qualitative Winning for Stochastic Parity Games

DOI10.4230/LIPIcs.CONCUR.2019.6OpenAlexW2971044115MaRDI QIDQ5875367

Krishnendu Chatterjee, Nir Piterman

Publication date: 3 February 2023

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

zbMATH Keywords

stochastic gamestwo player gamesparity winning conditions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (max. 100)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• The complexity of stochastic games
• Looking at mean-payoff and total-payoff through windows
• On Stochastic Games with Multiple Objectives
• Quantitative Multi-objective Verification for Probabilistic Systems
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
• Alternating-time temporal logic
• The determinacy of Blackwell games
• The complexity of probabilistic verification
• Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
• Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives
• Deciding parity games in quasipolynomial time
• Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
• Variations on the Stochastic Shortest Path Problem
• Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives
• Computer Science Logic
• Markov Decision Processes with Multiple Objectives
• Generalized Parity Games
• Multi-objective Model Checking of Markov Decision Processes
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Combinations of Qualitative Winning for Stochastic Parity Games