On the complexity of branching games with regular conditions

DOI10.4230/LIPICS.MFCS.2016.78zbMATH Open1398.68327MaRDI QIDQ4608641FDOQ4608641

Authors Marcin Przybyłko, Michał Skrzypczak 

Publication date 21 March 2018

zbMATH Keywords

stochastic gamesregular languagesinfinite treesparity automatameta-parity games

Mathematics Subject Classification ID

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

Recommendations

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

Cited In (5)

• The uniform measure of simple regular sets of infinite trees
• Separable GPL: decidable model checking with more non-determinism
• Branching time, perfect information games, and backward induction
• Computing branching distances with quantitative games
• Title not available (Why is no real title available?)

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)