Home > ENGINEERING > COMPUTER > CS_TECHREP > 611
Octavio Lerma Vladik Kreinovich, The University of Texas at El PasoFollow Chris Kiekintveld, The University of Texas at El PasoFollow
5-2011
Technical Report: UTEP-CS-11-17a
Published in Proceedings of the AAAI Workshop on Applied Adversarial Reasoning and Risk Modeling AARM'11, San Francisco, California, August 7, 2011
Game theory has become an important tools for making resource allocations decision in security domains, including critical infrastructure protection. Many of these games are formulated as Stackelberg security games. We present new analysis and algorithms for a class of Stackelberg security games with identical, fully protective defender resources. The first algorithm has worst-case complexity linear in the number of possible targets, but works only for a restricted case. The second algorithm can find and optimal resource allocation for the general case in time O(n log(n)).
DOWNLOADS
Since March 23, 2012
Computer Engineering Commons
Advanced Search
Comments
Technical Report: UTEP-CS-11-17a
Published in Proceedings of the AAAI Workshop on Applied Adversarial Reasoning and Risk Modeling AARM'11, San Francisco, California, August 7, 2011