Combinations of Qualitative Winning for Stochastic Parity Games

DOI10.4230/LIPICS.CONCUR.2019.6MaRDI QIDQ5875367zbMATH OpenOpenAlexFDO

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)

Recommendations

• Quantitative stochastic parity games
• Qualitative concurrent parity games
• Qualitative concurrent parity games: bounded rationality
• The complexity of partial-observation stochastic parity games with finite-memory strategies
• Perfect-information stochastic mean-payoff parity games

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• Alternating-time temporal logic
• CONCUR 2005 – Concurrency Theory
• Computer Science Logic
• Deciding parity games in quasipolynomial time
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
• Generalized Parity Games
• Looking at mean-payoff and total-payoff through windows
• Markov Decision Processes with Multiple Objectives
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
• Multi-objective Model Checking of Markov Decision Processes
• On stochastic games with multiple objectives
• Perfect-information stochastic games with generalized mean-payoff objectives
• Quantitative multi-objective verification for probabilistic systems
• Strategy synthesis for stochastic games with multiple long-run objectives
• Succinct progress measures for solving parity games
• The complexity of probabilistic verification
• The complexity of stochastic games
• The determinacy of Blackwell games
• Threshold constraints with guarantees for parity objectives in Markov decision processes
• Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
• Variations on the stochastic shortest path problem

Cited in

(1)

• 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)