@inproceedings{547f82da1e6e4c4faf45be8da9edcf48,
title = "A graph-theoretic approach to protect static and moving targets from adversaries",
abstract = "The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack those assets. The dynamic asset protection (DAP) problem is a version of SAP where the asset is following a fixed and widely known route (e.g., a parade route) and needs to bo protected. We formalize what it means for a given allocation of resources to be {"}optimal{"} for protecting a desired set of assets, and show that randomly allocating resources to a single edge cut in the road network solves this problem. Unlike SAP, we show that DAP is not only an NP-complete problem, but that approximating DAP is also NP-hard. We provide the GreedyDAP heuristic algorithm to solve DAP and show experimentally that it works well in practice, using road network data for real cities.",
keywords = "Adversarial Reasoning, Agent Systems, Game Theory",
author = "Dickerson, {J. P.} and Simari, {G. I.} and Subrahmanian, {V. S.} and Sarit Kraus",
year = "2010",
language = "אנגלית",
isbn = "9781617387715",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "299--306",
booktitle = "9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010",
note = "9th International Joint Conference on Autonomous Agents and Multiagent Systems 2010, AAMAS 2010 ; Conference date: 10-05-2010",
}