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

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

Namespace Prefixes

PrefixIRI
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://purl.org/net/nknouf/ns/bibtex#
n16http://localhost/temp/predkladatel/
n21http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n23http://linked.opendata.cz/resource/domain/vavai/zamer/
n6https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F11%3A00049981%21RIV12-GA0-14330___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n20http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F11%3A00049981%21RIV12-GA0-14330___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
We show that all quantitative approximation problems for the termination value for one-counter MDPs and one-counter stochastic games are computable. Specifically, given a one-counter game, and given e > 0, we can compute a value v that approximates the value of the termination game within additive error e, and furthermore we can compute e-optimal strategies for both players in the game. We show that all quantitative approximation problems for the termination value for one-counter MDPs and one-counter stochastic games are computable. Specifically, given a one-counter game, and given e > 0, we can compute a value v that approximates the value of the termination game within additive error e, and furthermore we can compute e-optimal strategies for both players in the game.
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/11:00049981!RIV12-GA0-14330___
n11:predkladatel
n12:orjk%3A14330
n3:aktivita
n13:P n13:Z
n3:aktivity
P(1M0545), P(GAP202/10/1469), Z(MSM0021622419)
n3:dodaniDat
n20:2012
n3:domaciTvurceVysledku
n19:9872655 n19:1762834 n19:5532787
n3:druhVysledku
n4:D
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
186948
n3:idVysledku
RIV/00216224:14330/11:00049981
n3:jazykVysledku
n8:eng
n3:klicovaSlova
stochastic games; one-counter automata
n3:klicoveSlovo
n10:one-counter%20automata n10:stochastic%20games
n3:kontrolniKodProRIV
[736F1DF16965]
n3:mistoKonaniAkce
Zurich, Switzerland
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
4
n3:projekt
n21:1M0545 n21:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n20:2011
n3:tvurceVysledku
Brázdil, Tomáš Kučera, Antonín Brožek, Václav Etessami, Kousha
n3:typAkce
n18:WRD
n3:zahajeniAkce
2011-01-01+01:00
n3:zamer
n23:MSM0021622419
s:numberOfPages
12
n22:hasPublisher
Springer-Verlag
n6:isbn
978-3-642-22011-1
n16:organizacniJednotka
14330