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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F14%3A00073686%21RIV15-MSM-14330___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
Patrolling games are partially observable games played by two players, the defender and the attacker. The defender aims for detecting intrusions into vulnerable targets by following randomized routes among them, the attacker strives to maximize the probability of a successful (undetected) intrusion. We show how to translate patrolling games into turn-based perfect information stochastic games with safety objectives so that optimal strategies in the perfect information games can be transferred back to patrolling games. We design, to the best of our knowledge, the best algorithm which can compute an epsilon-optimal strategy for the defender among all (history-dependent) strategies. Patrolling games are partially observable games played by two players, the defender and the attacker. The defender aims for detecting intrusions into vulnerable targets by following randomized routes among them, the attacker strives to maximize the probability of a successful (undetected) intrusion. We show how to translate patrolling games into turn-based perfect information stochastic games with safety objectives so that optimal strategies in the perfect information games can be transferred back to patrolling games. We design, to the best of our knowledge, the best algorithm which can compute an epsilon-optimal strategy for the defender among all (history-dependent) strategies.
dcterms:title
Solving adversarial patrolling games with bounded error: (extended abstract) Solving adversarial patrolling games with bounded error: (extended abstract)
skos:prefLabel
Solving adversarial patrolling games with bounded error: (extended abstract) Solving adversarial patrolling games with bounded error: (extended abstract)
skos:notation
RIV/00216224:14330/14:00073686!RIV15-MSM-14330___
n3:aktivita
n4:I n4:S n4:P
n3:aktivity
I, P(GAP202/10/1469), S
n3:dodaniDat
n14:2015
n3:domaciTvurceVysledku
n13:3749231 n13:9668780 n13:1762834 n13:9872655 n13:8986371
n3:druhVysledku
n20:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
45932
n3:idVysledku
RIV/00216224:14330/14:00073686
n3:jazykVysledku
n18:eng
n3:klicovaSlova
patrolling games; stochastic games; epsilon-optimal strategy
n3:klicoveSlovo
n7:epsilon-optimal%20strategy n7:patrolling%20games n7:stochastic%20games
n3:kontrolniKodProRIV
[0DEF0E188B96]
n3:mistoKonaniAkce
paris
n3:mistoVydani
Richland, SC, USA
n3:nazevZdroje
Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14)
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
5
n3:pocetTvurcuVysledku
6
n3:projekt
n8:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n14:2014
n3:tvurceVysledku
Bošanský, Branislav Řehák, Vojtěch Kučera, Antonín Krčál, Jan Abaffy, Michal Brázdil, Tomáš
n3:typAkce
n19:WRD
n3:zahajeniAkce
2014-01-01+01:00
s:numberOfPages
2
n12:hasPublisher
International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
n16:isbn
9781450327381
n17:organizacniJednotka
14330