@conference {17751,
	title = {A graph-theoretic approach to protect static and moving targets from adversaries},
	booktitle = {Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1},
	series = {AAMAS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {299 - 306},
	publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
	organization = {International Foundation for Autonomous Agents and Multiagent Systems},
	address = {Richland, SC},
	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 be 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},
	isbn = {978-0-9826571-1-9},
	url = {http://dl.acm.org/citation.cfm?id=1838206.1838248},
	author = {Dickerson,J. P. and Simari,G. I and V.S. Subrahmanian and Kraus,Sarit}
}
