Playing Repeated Security Games with No Prior Knowledge
暂无分享,去创建一个
[1] Milind Tambe,et al. Beware the Soothsayer: From Attack Prediction Accuracy to Predictive Reliability in Security Games , 2015, GameSec.
[2] Ariel D. Procaccia,et al. Learning Optimal Commitment to Overcome Insecurity , 2014, NIPS.
[3] Maria-Florina Balcan,et al. Commitment Without Regrets: Online Learning in Stackelberg Security Games , 2015, EC.
[4] Sarit Kraus,et al. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS.
[5] Milind Tambe,et al. "A Game of Thrones": When Human Behavior Models Compete in Repeated Stackelberg Security Games , 2015, AAMAS.
[6] Rong Yang,et al. Adaptive resource allocation for wildlife protection against illegal poachers , 2014, AAMAS.
[7] Viliam Lisý,et al. Online Learning Methods for Border Patrol Resource Allocation , 2014, GameSec.
[8] Manish Jain,et al. Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.
[9] Sarit Kraus,et al. Deployed ARMOR protection: the application of a game theoretic model for security at the Los Angeles International Airport , 2008, AAMAS 2008.
[10] Moshe Tennenholtz,et al. Program equilibrium , 2004, Games Econ. Behav..
[11] Amos Azaria,et al. Analyzing the Effectiveness of Adversary Modeling in Security Games , 2013, AAAI.
[12] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[13] Bo An,et al. Security Games with Limited Surveillance , 2012, AAAI.
[14] Milind Tambe,et al. When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing , 2015, IJCAI.
[15] Drew Fudenberg,et al. Game theory (3. pr.) , 1991 .
[16] Bhaskar Krishnamachari,et al. Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations , 2010, IEEE/ACM Transactions on Networking.
[17] Nicolò Cesa-Bianchi,et al. Combinatorial Bandits , 2012, COLT.
[18] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).
[19] Milind Tambe,et al. Robust Protection of Fisheries with COmPASS , 2014, AAAI.
[20] Gergely Neu,et al. An Efficient Algorithm for Learning with Semi-bandit Feedback , 2013, ALT.
[21] Viliam Lisý,et al. Combining Online Learning and Equilibrium Computation in Security Games , 2015, GameSec.
[22] Gergely Neu,et al. Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits , 2015, J. Mach. Learn. Res..
[23] Milind Tambe,et al. Approximation methods for infinite Bayesian Stackelberg games: modeling distributional payoff uncertainty , 2011, AAMAS.
[24] Sarit Kraus,et al. Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition , 2010, Artif. Intell..
[25] Zheng Wen,et al. Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits , 2014, AISTATS.
[26] Moshe Tennenholtz,et al. Bundling equilibrium in combinatorial auctions , 2002, Games Econ. Behav..
[27] Milind Tambe,et al. Addressing Scalability and Robustness in Security Games with Multiple Boundedly Rational Adversaries , 2014, GameSec.
[28] Juliane Hahn,et al. Security And Game Theory Algorithms Deployed Systems Lessons Learned , 2016 .