Sciweavers

21 search results - page 3 / 5
» Robust Bayesian methods for Stackelberg security games
Sort
View
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
14 years 8 days ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
ATAL
2008
Springer
13 years 9 months ago
Deployed ARMOR protection: the application of a game theoretic model for security at the 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, Janusz Marecki, Fernando ...
ML
2010
ACM
138views Machine Learning» more  ML 2010»
13 years 2 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
ATAL
2009
Springer
14 years 2 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
AAAI
2010
13 years 9 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...