scientific article; zbMATH DE number 7561608

DOI10.4230/LIPICS.ICALP.2019.115MaRDI QIDQ5091277zbMATH OpenFDO

Authors Kousha Etessami, Emanuel Martinov, Alistair Stewart, Mihalis Yannakakis

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1806.03907

zbMATH Keywords

almost-sureconcurrent gameslimit-sureminimax-polynomial equationsmulti-type branching processesreachabilitystochastic games

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Reachability in Stochastic Timed Games
• Concurrent reachability games
• Monomial strategies for concurrent reachability games and other stochastic games
• Qualitative reachability in stochastic BPA games
• Qualitative reachability in stochastic BPA games
• Partial-observation stochastic reachability and parity games
• Recursive Concurrent Stochastic Games
• Recursive Concurrent Stochastic Games
• Continuous-time stochastic games with time-bounded reachability
• Continuous-time stochastic games with time-bounded reachability

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A polynomial time algorithm for computing extinction probabilities of multitype branching processes
• Analysis of probabilistic basic parallel processes
• Approximating the value of a concurrent reachability game in the polynomial time hierarchy
• Branching Processes
• Branching processes in biology
• Concurrent reachability games
• Expected termination time in BPA games
• Growth Optimality for Branching Markov Decision Chains
• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 7204389 (Why is no real title available?)
• scientific article; zbMATH DE number 3190745 (Why is no real title available?)
• Model Checking Probabilistic Pushdown Automata
• Model Checking Stochastic Branching Processes
• On the problem of computing the probability of regular sets of trees
• Optimization of Multitype Branching Processes
• Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
• Qualitative reachability in stochastic BPA games
• Reachability in recursive Markov decision processes
• Recursive Concurrent Stochastic Games
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Recursive Markov decision processes and recursive stochastic games
• Recursive Stochastic Games with Positive Rewards
• The complexity of stochastic games
• Totally expanding multiplicative systems

Cited in

(3)

• Multi-player equilibria verification for concurrent stochastic games
• Alternating Reachability Games with Behavioral and Revenue Objectives
• Recursive Concurrent Stochastic Games

This page was built for publication:

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