. "14330" . "000313861100010" . . . . "Information and Computation" . . . "61896" . . . "10.1016/j.ic.2012.01.008" . "Approximating the termination value of one-counter MDPs and stochastic games"@en . "RIV/00216224:14330/13:00065955" . . "I, P(1M0545), P(GAP202/10/1469)" . . . "RIV/00216224:14330/13:00065955!RIV14-MSM-14330___" . "0890-5401" . . "January" . "Approximating the termination value of one-counter MDPs and stochastic games" . "222" . . "Markov decision processes; one-counter automata"@en . . . . "Etessami, Kousha" . "NL - Nizozemsko" . "One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems (%22is the optimal termination value equal to 1?%22) for OC-MDPs (and OC-SSGs) and showed them to be decidable in polynomial time (in NP intersection coNP, respectively). However, quantitative decision and approximation problems (%22is the optimal termination value at least p%22, or %22approximate the termination value within epsilon%22) are far more challenging."@en . "[FAD00E2C9934]" . "Approximating the termination value of one-counter MDPs and stochastic games"@en . "Bro\u017Eek, V\u00E1clav" . "18"^^ . "One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter stack alphabet). A key objective for the analysis and verification of these games is the termination objective, where the players aim to maximize (minimize, respectively) the probability of hitting counter value 0, starting at a given control state and given counter value. Recently, we studied qualitative decision problems (%22is the optimal termination value equal to 1?%22) for OC-MDPs (and OC-SSGs) and showed them to be decidable in polynomial time (in NP intersection coNP, respectively). However, quantitative decision and approximation problems (%22is the optimal termination value at least p%22, or %22approximate the termination value within epsilon%22) are far more challenging." . . "Br\u00E1zdil, Tom\u00E1\u0161" . . . "3"^^ . "Approximating the termination value of one-counter MDPs and stochastic games" . "4"^^ . "Ku\u010Dera, Anton\u00EDn" .