Sciweavers

21 search results - page 2 / 5
» Robust Bayesian methods for Stackelberg security games
Sort
View
ATAL
2011
Springer
12 years 5 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
AI
2010
Springer
13 years 2 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
AAAI
2011
12 years 5 months ago
Risk-Averse Strategies for Security Games with Execution and Observational Uncertainty
Attacker-defender Stackelberg games have become a popular game-theoretic approach for security with deployments for LAX Police, the FAMS and the TSA. Unfortunately, most of the ex...
Zhengyu Yin, Manish Jain, Milind Tambe, Fernando O...
ATAL
2009
Springer
14 years 6 days ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
AAAI
2008
13 years 8 months ago
ARMOR Security for Los Angeles International Airport
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 f...
James Pita, Manish Jain, Fernando Ordó&ntil...