Vehicle routing with time windows
Operations Research
A modeling language for mathematical programming
Management Science
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Multi-Agent Patrolling with Reinforcement Learning
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Theoretical Analysis of the Multi-agent Patrolling Problem
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The Period Vehicle Routing Problem with Service Choice
Transportation Science
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
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
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
The impact of adversarial knowledge on adversarial planning in perimeter patrol
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
A realistic model of frequency-based multi-robot polyline patrolling
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Probabilistic Multiagent Patrolling
SBIA '08 Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
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
Computing optimal randomized resource allocations for massive security games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Uncertainties in adversarial patrol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Developing a Deterministic Patrolling Strategy for Security Agents
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Adversarial uncertainty in multi-robot patrol
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Multi-agent patrolling: an empirical analysis of alternative architectures
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Computing optimal strategies to commit to in extensive-form games
Proceedings of the 11th ACM conference on Electronic commerce
On events in multi-robot patrol in adversarial environments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 2 - Volume 2
How to protect a city: strategic security placement in graph-based domains
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A Game-Theoretical Model Applied to an Active Patrolling Camera
EST '10 Proceedings of the 2010 International Conference on Emerging Security Technologies
TALOS: a tool for designing security applications with mobile patrolling robots
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Randomized pursuit-evasion in a polygonal environment
IEEE Transactions on Robotics
Bounded planning for strategic goals with incomplete information and perfect recall
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Introducing alarms in adversarial patrolling games: extended abstract
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Security games are gaining significant interest in artificial intelligence. They are characterized by two players (a defender and an attacker) and by a set of targets the defender tries to protect from the attacker@?s intrusions by committing to a strategy. To reach their goals, players use resources such as patrollers and intruders. Security games are Stackelberg games where the appropriate solution concept is the leader-follower equilibrium. Current algorithms for solving these games are applicable when the underlying game is in normal form (i.e., each player has a single decision node). In this paper, we define and study security games with an extensive-form infinite-horizon underlying game, where decision nodes are potentially infinite. We introduce a novel scenario where the attacker can undertake actions during the execution of the defender@?s strategy. We call this new game class patrolling security games (PSGs), since its most prominent application is patrolling environments against intruders. We show that PSGs cannot be reduced to security games studied so far and we highlight their generality in tackling adversarial patrolling on arbitrary graphs. We then design algorithms to solve large instances with single patroller and single intruder.