Security Games with Mobile Patrollers (Extended Abstract)

Result code in 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>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Security Games with Mobile Patrollers (Extended Abstract)

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Publication year

2011

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

AAMAS 2011

ISBN

978-0-9826571-8-8

ISSN

—

e-ISSN

—

Number of pages

1

Pages from-to

1372

Publisher name

IFAAMAS

Place of publication

County of Richland

Event location

Taipei,

Event date

May 2, 2011

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—