Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Security in multiagent systems by policy randomization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Defending Critical Infrastructure
Interfaces
An efficient heuristic approach for security against multiple adversaries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Coordinating randomized policies for increasing security of agent systems
Information Technology and Management
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing optimal randomized resource allocations for massive security games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Efficient algorithms to solve Bayesian Stackelberg games for security applications
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Algorithms and complexity results for pursuit-evasion problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Robust Bayesian methods for Stackelberg security games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Methods and algorithms for infinite Bayesian Stackelberg security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
GUARDS and PROTECT: next generation applications of security games
ACM SIGecom Exchanges
Security applications: lessons of real-world deployment
ACM SIGecom Exchanges
GUARDS: game theoretic security allocation on a national scale
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing time-dependent policies for patrolling games with mobile targets
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Improved computational models of human behavior in security games
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
TALOS: a tool for designing security applications with mobile patrolling robots
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Game theory and human behavior: challenges in security and sustainability
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Journal of Artificial Intelligence Research
Approximation algorithm for security games with costly resources
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Improving resource allocation strategy against human adversaries in security games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Playing repeated Stackelberg games with unknown opponents
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Resource Allocation for Homeland Defense: Dealing with the Team Effect
Decision Analysis
Game theory for security: an important challenge for multiagent systems
EUMAS'11 Proceedings of the 9th European conference on Multi-Agent Systems
Security games with surveillance cost and optimal timing of attack execution
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Security games with interval uncertainty
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Modeling human adversary decision making in security games: an initial report
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent full security coverage at all times, which allows adversaries to observe and exploit patterns in selective patrolling or monitoring, e.g. they can plan an attack avoiding existing patrols. Hence, randomized patrolling or monitoring is important, but randomization must provide distinct weights to different actions based on their complex costs and benefits. To this end, this paper describes a promising transition of the latest in multi-agent algorithms -- in fact, an algorithm that represents a culmination of research presented at AAMAS - into a deployed application. In particular, it describes a software assistant agent called ARMOR (Assistant for Randomized Monitoring over Routes) that casts this patrolling/monitoring problem as a Bayesian Stackelberg game, allowing the agent to appropriately weigh the different actions in randomization, as well as uncertainty over adversary types. ARMOR combines three key features: (i) It uses the fastest known solver for Bayesian Stackelberg games called DOBSS, where the dominant mixed strategies enable randomization; (ii) Its mixed-initiative based interface allows users to occasionally adjust or override the automated schedule based on their local constraints; (iii) It alerts the users if mixed-initiative overrides appear to degrade the overall desired randomization. ARMOR has been successfully deployed since August 2007 at the Los Angeles International Airport (LAX) to randomize checkpoints on the roadways entering the airport and canine patrol routes within the airport terminals. This paper examines the information, design choices, challenges, and evaluation that went into designing ARMOR.