Expected termination time in BPA games

DOI10.1007/978-3-319-02444-8_22MaRDI QIDQ5166695zbMATH OpenOpenAlexFDO

Authors Dominik Wojtczak

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_22

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Qualitative reachability in stochastic BPA games
• Recursive Concurrent Stochastic Games
• Recursive Concurrent Stochastic Games
• Qualitative reachability in stochastic BPA games
• Reachability in recursive Markov decision processes

Cited in

(2)

• Recursive stochastic games with positive rewards
• scientific article; zbMATH DE number 7561608 (Why is no real title available?)

This page was built for publication: Expected termination time in BPA games

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