This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n5http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n12http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F13%3A00065955%21RIV14-MSM-14330___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F13%3A00065955%21RIV14-MSM-14330___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
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. 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.
dcterms:title
Approximating the termination value of one-counter MDPs and stochastic games Approximating the termination value of one-counter MDPs and stochastic games
skos:prefLabel
Approximating the termination value of one-counter MDPs and stochastic games Approximating the termination value of one-counter MDPs and stochastic games
skos:notation
RIV/00216224:14330/13:00065955!RIV14-MSM-14330___
n11:predkladatel
n20:orjk%3A14330
n3:aktivita
n4:P n4:I
n3:aktivity
I, P(1M0545), P(GAP202/10/1469)
n3:cisloPeriodika
January
n3:dodaniDat
n14:2014
n3:domaciTvurceVysledku
n16:9872655 n16:1762834 n16:5532787
n3:druhVysledku
n9:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n10:predkladatel
n3:idSjednocenehoVysledku
61896
n3:idVysledku
RIV/00216224:14330/13:00065955
n3:jazykVysledku
n8:eng
n3:klicovaSlova
Markov decision processes; one-counter automata
n3:klicoveSlovo
n6:Markov%20decision%20processes n6:one-counter%20automata
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[FAD00E2C9934]
n3:nazevZdroje
Information and Computation
n3:obor
n17:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
4
n3:projekt
n7:GAP202%2F10%2F1469 n7:1M0545
n3:rokUplatneniVysledku
n14:2013
n3:svazekPeriodika
222
n3:tvurceVysledku
Etessami, Kousha Brožek, Václav Brázdil, Tomáš Kučera, Antonín
n3:wos
000313861100010
s:issn
0890-5401
s:numberOfPages
18
n12:doi
10.1016/j.ic.2012.01.008
n5:organizacniJednotka
14330