Extending Security Games to Defenders with Constrained Mobility

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00195293" target="_blank" >RIV/68407700:21230/12:00195293 - isvavai.cz</a>
Result on the web
<a href="http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/view/4276/4649" target="_blank" >http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/view/4276/4649</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Extending Security Games to Defenders with Constrained Mobility
Original language description
A number of real-world security scenarios can be cast as a problem of transiting an area guarded by a mobile patroller, where the transiting agent aims to choose its route so as to minimize the probability of encountering the patrolling agent, and vice versa. We model this problem as a two-player zero-sum game on a graph, termed the transit game. In contrast to the existing models of area transit, where one of the players is stationary, we assume both players are mobile. We also explicitly model the limited endurance of the patroller and the notion of a base to which the patroller has to repeatedly return. Noting the prohibitive size of the strategy spaces of both players, we develop single- and double-oracle based algorithms including a novel acceleration scheme, to obtain optimum route selection strategies for both players. We evaluate the developed approach on a range of transit game instances inspired by real-world security problems in the urban and naval security domains.
Czech name
—
Czech description
—

Project
<a href="/en/project/LH11051" target="_blank" >LH11051: Formal models and effective algorithms for the intelligent protection of transport infrastructures.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)