About: Solving adversarial patrolling games with bounded error: (extended abstract)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
Title
  • Solving adversarial patrolling games with bounded error: (extended abstract)
  • Solving adversarial patrolling games with bounded error: (extended abstract) (en)
skos:prefLabel
  • Solving adversarial patrolling games with bounded error: (extended abstract)
  • Solving adversarial patrolling games with bounded error: (extended abstract) (en)
skos:notation
  • RIV/00216224:14330/14:00073686!RIV15-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, P(GAP202/10/1469), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 45932
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/14:00073686
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • patrolling games; stochastic games; epsilon-optimal strategy (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [0DEF0E188B96]
http://linked.open...v/mistoKonaniAkce
  • paris
http://linked.open...i/riv/mistoVydani
  • Richland, SC, USA
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'14)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bošanský, Branislav
  • Brázdil, Tomáš
  • Krčál, Jan
  • Kučera, Antonín
  • Řehák, Vojtěch
  • Abaffy, Michal
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
https://schema.org/isbn
  • 9781450327381
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software