This HTML5 document contains 49 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/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F13%3A00065989%21RIV14-MSM-14330___/
n13http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n9http://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/
n7http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F13%3A00065989%21RIV14-MSM-14330___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games. We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute epsilon-optimal strategies in finite games and provide detailed complexity estimations. Moreover, we show how to compute epsilon-optimal strategies in infinite games with finite branching and bounded rates where the bound as well as the successors of a given state are effectively computable. Finally, we show how to compute optimal strategies in finite uniform games.
dcterms:title
Continuous-Time Stochastic Games with Time-Bounded Reachability Continuous-Time Stochastic Games with Time-Bounded Reachability
skos:prefLabel
Continuous-Time Stochastic Games with Time-Bounded Reachability Continuous-Time Stochastic Games with Time-Bounded Reachability
skos:notation
RIV/00216224:14330/13:00065989!RIV14-MSM-14330___
n9:predkladatel
n17:orjk%3A14330
n3:aktivita
n19:S n19:P
n3:aktivity
P(GAP202/10/1469), S
n3:cisloPeriodika
1
n3:dodaniDat
n12:2014
n3:domaciTvurceVysledku
n4:1762834 n4:9668780 n4:9872655 n4:3503054 n4:2477912
n3:druhVysledku
n15:J
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
66901
n3:idVysledku
RIV/00216224:14330/13:00065989
n3:jazykVysledku
n8:eng
n3:klicovaSlova
continuous time stochastic systems; time-bounded reachability; stochastic games
n3:klicoveSlovo
n5:stochastic%20games n5:continuous%20time%20stochastic%20systems n5:time-bounded%20reachability
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[01D2AAA110F8]
n3:nazevZdroje
Information and Computation
n3:obor
n18:IN
n3:pocetDomacichTvurcuVysledku
5
n3:pocetTvurcuVysledku
5
n3:projekt
n16:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n12:2013
n3:svazekPeriodika
224
n3:tvurceVysledku
Forejt, Vojtěch Krčál, Jan Kučera, Antonín Brázdil, Tomáš Křetínský, Jan
n3:wos
000315361200003
s:issn
0890-5401
s:numberOfPages
25
n7:doi
10.1016/j.ic.2013.01.001
n13:organizacniJednotka
14330