scientific article; zbMATH DE number 6297753
From MaRDI portal
Publication:5417673
zbMath1288.90119MaRDI QIDQ5417673
Dominik Wojtczak, Tomáš Brázdil, Kousha Etessami, Václav Brožek, Antonín Kučera
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decision theory for games (91A35)
Related Items (16)
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs ⋮ The Odds of Staying on Budget ⋮ Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Ratio and Weight Quantiles ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ The Viterbi algorithm for subsets of stochastic context-free languages ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Runtime Analysis of Probabilistic Programs with Unbounded Recursion ⋮ Approximating the Termination Value of One-Counter MDPs and Stochastic Games ⋮ Analyzing probabilistic pushdown automata ⋮ Mitigating Multi-target Attacks in Hash-Based Signatures ⋮ Runtime analysis of probabilistic programs with unbounded recursion ⋮ Qualitative Analysis of VASS-Induced MDPs ⋮ A Survey of Bidding Games on Graphs (Invited Paper) ⋮ Infinite-Duration Bidding Games
This page was built for publication:
