Security Games with Mobile Patrollers (Extended Abstract)

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183242" target="_blank" >RIV/68407700:21230/11:00183242 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Security Games with Mobile Patrollers (Extended Abstract)
Popis výsledku v původním jazyce
To optimally secure large and complex infrastructures against crime activities, a scalable model for optimal defender allocation is needed. Game theory is successfully used to formalize the problem as a two-player game between an attacker and a defender.We consider both player to be mobile, we focus on proper path intersection modeling and we observe the trade-off between fidelity and computational complexity. We search for a Nash Equilibrium of the game using oracle based algorithms and we evaluate the robustness of the solution in a multi-agent simulation where some assumptions made do not strictly hold.
Název v anglickém jazyce
Security Games with Mobile Patrollers (Extended Abstract)
Popis výsledku anglicky
To optimally secure large and complex infrastructures against crime activities, a scalable model for optimal defender allocation is needed. Game theory is successfully used to formalize the problem as a two-player game between an attacker and a defender.We consider both player to be mobile, we focus on proper path intersection modeling and we observe the trade-off between fidelity and computational complexity. We search for a Nash Equilibrium of the game using oracle based algorithms and we evaluate the robustness of the solution in a multi-agent simulation where some assumptions made do not strictly hold.

Rok uplatnění
2011
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)