On the complexity of branching games with regular conditions

DOI10.4230/LIPICS.MFCS.2016.78MaRDI QIDQ4608641zbMATH OpenFDO

Authors Marcin Przybyłko, Michał Skrzypczak

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.78

zbMATH Keywords

infinite treesmeta-parity gamesparity automataregular languagesstochastic games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Applications of game theory (91A80)

Recommendations

• scientific article; zbMATH DE number 7362735
• Mathematical Foundations of Computer Science 2005
• Concurrent games and semi-random determinacy
• Quantitative solution of -regular games
• Automata, Languages and Programming

Cited in

(5)

• The uniform measure of simple regular sets of infinite trees
• Computing branching distances with quantitative games
• On computing the measures of first-order definable sets of trees
• Separable GPL: decidable model checking with more non-determinism
• Branching time, perfect information games, and backward induction

This page was built for publication: On the complexity of branching games with regular conditions

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