Solving adversarial patrolling games with bounded error

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224941" target="_blank" >RIV/68407700:21230/14:00224941 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Solving adversarial patrolling games with bounded error
Original language 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 first algorithm which can compute an ?-optimal strategy for the defender among all (history-dependent) strategies.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F12%2F2054" target="_blank" >GAP202/12/2054: Security Games in Extensive Form</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems
ISBN
978-1-4503-2738-1
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
1617-1618
Publisher name
IFAAMAS
Place of publication
County of Richland
Event location
Paris
Event date
May 5, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)