Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
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
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track
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
ARMOR security for Los Angeles international airport
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
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
Learning and Approximating the Optimal Strategy to Commit To
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A game theory approach for the reallocation of securityforces against terrorist diversionary attacks
ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics
Capturing augmented sensing capabilities and intrusion delay in patrolling-intrusion games
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Computing optimal strategies to commit to in extensive-form games
Proceedings of the 11th ACM conference on Electronic commerce
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
Robust Bayesian methods for Stackelberg security games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Uncertainty in interdependent security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
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
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Securing networks using game theory: algorithms and applications
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
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
Multiagent Communication Security in Adversarial Settings
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Theoretical analysis of expected payoff in an adversarial domain
Information Sciences: an International Journal
Security games with multiple attacker resources
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Security and network effects: centralized and decentralized perspectives
ACM SIGecom Exchanges
Playing repeated Stackelberg games with unknown opponents
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Multi-objective optimization for security games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Solving non-zero sum multiagent network flow security games with attack costs
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Game-theoretic resource allocation for malicious packet detection in computer networks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A robust approach to addressing human adversaries in security games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Computing optimal security strategies in networked domains: a cost-benefit approach
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Game theory for security: an important challenge for multiagent systems
EUMAS'11 Proceedings of the 9th European conference on Multi-Agent Systems
Optimal interdiction of attack plans
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Game-theoretic randomization for security patrolling with dynamic execution uncertainty
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
Game-theoretic patrol strategies for transit systems: the TRUSTS system and its mobile app
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Computing Stackelberg strategies in stochastic games
ACM SIGecom Exchanges
Defender (mis)coordination in security games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Game-theoretic question selection for tests
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Efficiently solving joint activity based security games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
An extended study on multi-objective security games
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and a robber (follower) has a chance to observe this strategy over time before choosing its own strategy of where to attack. This paper presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games. This algorithm, DOBSS, is based on a novel and compact mixed-integer linear programming formulation. Compared to the most efficient algorithm known previously for this problem, DOBSS is not only faster, but also leads to higher quality solutions, and does not suffer from problems of infeasibility that were faced by this previous algorithm. Note that DOBSS is at the heart of the ARMOR system that is currently being tested for security scheduling at the Los Angeles International Airport.