Making the Most of Our Regrets: Regret-Based Solutions to Handle Payoff Uncertainty and Elicitation in Green Security Games

Recent research on Green Security Games (GSG), i.e., security games for the protection of wildlife, forest and fisheries, relies on the promise of an abundance of available data in these domains to learn adversary behavioral models and determine game payoffs. This research suggests that adversary behavior models (capturing bounded rationality) can be learned from real-world data on where adversaries have attacked, and that game payoffs can be determined precisely from data on animal densities. However, previous work has, as yet, failed to demonstrate the usefulness of these behavioral models in capturing adversary behaviors based on real-world data in GSGs. Previous work has also been unable to address situations where available data is insufficient to accurately estimate behavioral models or to obtain the required precision in the payoff values.

[1]  Nicola Basilico,et al.  Leader-follower strategies for robotic patrolling in environments with arbitrary topologies , 2009, AAMAS.

[2]  Milind Tambe,et al.  Robust Protection of Fisheries with COmPASS , 2014, AAAI.

[3]  Benjamin Van Roy,et al.  On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming , 2004, Math. Oper. Res..

[4]  Milind Tambe,et al.  Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties , 2009, AAMAS 2009.

[5]  R. Wilcox Applying Contemporary Statistical Techniques , 2003 .

[6]  Milind Tambe,et al.  Addressing Scalability and Robustness in Security Games with Multiple Boundedly Rational Adversaries , 2014, GameSec.

[7]  E. Brunswik The conceptual framework of psychology , 1952 .

[8]  Juliane Hahn Security And Game Theory Algorithms Deployed Systems Lessons Learned , 2016 .

[9]  Milind Tambe,et al.  Online planning for optimal protector strategies in resource conservation games , 2014, AAMAS.

[10]  Craig Boutilier,et al.  Constraint-based optimization and utility elicitation using the minimax decision criterion , 2006, Artif. Intell..

[11]  Vincent Conitzer,et al.  Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness , 2010, AAMAS 2010.

[12]  Vladik Kreinovich,et al.  Security games with interval uncertainty , 2013, AAMAS.

[13]  Craig Boutilier,et al.  Assessing regret-based preference elicitation with the UTPREF recommendation system , 2010, EC '10.

[14]  Yevgeniy Vorobeychik,et al.  Computing Randomized Security Strategies in Networked Domains , 2011, Applied Adversarial Reasoning and Risk Modeling.

[15]  Milind Tambe,et al.  When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing , 2015, IJCAI.

[16]  Bo An,et al.  PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.

[17]  Kevin Leyton-Brown,et al.  Level-0 meta-models for predicting human behavior in games , 2014, EC.

[18]  Milind Tambe,et al.  TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory , 2012, AI Mag..

[19]  R. McKelvey,et al.  Quantal Response Equilibria for Normal Form Games , 1995 .

[20]  Vincent Conitzer,et al.  Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness , 2011, J. Artif. Intell. Res..

[21]  Rong Yang,et al.  Adaptive resource allocation for wildlife protection against illegal poachers , 2014, AAMAS.

[22]  Amos Azaria,et al.  Analyzing the Effectiveness of Adversary Modeling in Security Games , 2013, AAAI.

[23]  Rong Yang,et al.  Computing optimal strategy against quantal response in security games , 2012, AAMAS.

[24]  Yoav Shoham,et al.  Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[25]  D. McFadden Conditional logit analysis of qualitative choice behavior , 1972 .

[26]  Vincent Conitzer,et al.  Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.

[27]  Bo An,et al.  Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty , 2014, AAAI.

[28]  Manish Jain,et al.  Computing optimal randomized resource allocations for massive security games , 2009, AAMAS 2009.

[29]  S. French,et al.  Decision Theory: An Introduction to the Mathematics of Rationality. , 1988 .