The complexity of eliminating dominated strategies
Mathematics of Operations Research
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
A polynomial-time nash equilibrium algorithm for repeated games
Proceedings of the 4th ACM conference on Electronic commerce
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Computing Nash equilibria of action-graph games
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Complexity of (iterated) dominance
Proceedings of the 6th ACM conference on Electronic commerce
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A generalized strategy eliminability criterion and computational methods for applying it
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Perspectives on multiagent learning
Artificial Intelligence
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
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: 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
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
Computing optimal strategies to commit to in extensive-form games
Proceedings of the 11th ACM conference on Electronic commerce
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
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
Methods and algorithms for infinite Bayesian Stackelberg security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
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
Solving Stackelberg games with uncertain observability
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
Journal of Artificial Intelligence Research
Security games with multiple attacker resources
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
GUARDS: innovative application of game theory for national airport security
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Security and network effects: centralized and decentralized perspectives
ACM SIGecom Exchanges
PROTECT: a deployed game theoretic system to protect the ports of the United States
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
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
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
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
Equilibrium pricing with positive externalities
Theoretical Computer Science
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
Introducing alarms in adversarial patrolling games: extended abstract
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
Computing Stackelberg strategies in stochastic games
ACM SIGecom Exchanges
Planning and learning in security games
ACM SIGecom Exchanges
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
Scaling-up security games with boundedly rational adversaries: a cutting-plane approach
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
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realistic. In many settings, one player is able to commit to a strategy before the other player makes a decision. Such models are synonymously referred to as leadership, commitment, or Stackelberg models, and optimal play in such models is often significantly different from optimal play in the model where strategies are selected simultaneously.The recent surge in interest in computing game-theoretic solutions has so far ignored leadership models (with the exception of the interest in mechanism design, where the designer is implicitly in a leadership position). In this paper, we study how to compute optimal strategies to commit to under both commitment to pure strategies and commitment to mixed strategies, in both normal-form and Bayesian games. We give both positive results (efficient algorithms) and negative results (NP-hardness results).