Accession Number ADA580068
Title Efficient Algorithms for Computing Stackelberg Strategies in Security Games.
Publication Date May 2012
Media Count 11p
Personal Author R. Parr V. Conitzer
Abstract Game theory provides a framework for modeling a wide range of security and defense problems. This project focuses on Stackelberg strategies, which are optimal when one player can commit to a (possibly randomized) strategy before the other player moves. For example, a defensive unit can commit to a randomized patrolling pattern to deter attacks. This project explores new approaches for efficiently computing Stackelberg strategies in realistic security domains with exponentially large strategy spaces. Potential impacts of this research include increased ability to compute optimal strategies for security and defense scenarios.
Keywords Algorithms
Game theory
Nash strategies
Rugged(Randomization in urban graphs by generating strategie
Stackelberg strategies

Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
72E - Operations Research
Corporate Author Duke Univ., Durham, NC.
Document Type Technical report
Title Note Final rept. 1 Sep 2009-31 Aug 2011.
NTIS Issue Number 1325
Contract Number W911NF-09-1-0459

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader