Combinations of Qualitative Winning for Stochastic Parity Games

DOI10.4230/LIPICS.CONCUR.2019.6OpenAlexW2971044115MaRDI QIDQ5875367FDOQ5875367

Authors: 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?)
• Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
• 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
• Succinct progress measures for solving parity games
• 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
• Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis

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)