Combinations of Qualitative Winning for Stochastic Parity Games

DOI10.4230/LIPICS.CONCUR.2019.6OpenAlexW2971044115MaRDI QIDQ5875367FDOQ5875367

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)

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• Fast symbolic algorithms for omega-regular games under strong transition fairness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875367)