Project Description

Security is a critical concern around the world, whether it is the challenge of protecting ports, airports and other critical national infrastructure, or protecting wildlife/forests and fisheries, or suppressing crime in urban areas. In many of these cases, limited security resources prevent full security coverage at all times. Instead, these limited resources must be allocated and scheduled efficiently, avoiding predictability, while simultaneously taking into account an adversary’s response to the security coverage, the adversary’s preferences and potential uncertainty over such preferences and capabilities. Computational game theory can help us build decision-aids for such efficient security resource allocation problems.

Publications

• Thanh Nguyen, Nam Vu, Amulya Yadav, Uy Nguyen. Decoding the Imitation Security Game: Handling Attacker Imitative Behavior Deception. In Proc. 24th European Conference on Artificial Intelligence (ECAI), pp. 179–186, 2020.

• Thanh Nguyen, Amulya Yadav, Branislav Bosansky, Yu Liang. Tackling Sequential Attacks in Security Games. In Proc. 10th Conference on Decision and Game Theory for Security (Gamesec), pp. 331-351, 2019.

• Shahrzad Gholami, Amulya Yadav, Long Tran-Thanh, Bistra Dilkina, Milind Tambe. Dont Put All Your Strategies in One Basket: Playing Green Security Games with Imperfect Prior Knowledge. In Proc. 17th Intl. Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 395-403, 2019.

• Benjamin Ford, Matthew Brown, Amulya Yadav, Amandeep Singh, Arunesh Sinha, Biplav Srivastava, Christopher Kiekintveld and Milind Tambe. Protecting the NECTAR of the Ganga River through Game-Theoretic Factory Inspections. In Proc. 14th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS), pp. 97-108, 2016.

• Eric Shieh, Albert Xin Jiang, Amulya Yadav, Pradeep Varakantham and Milind Tambe. An Extended Study on Addressing Defender Teamwork while accounting for Uncertainty in Attacker Defender Games using Iterative Dec-MDPs. In Multiagent and Grid Systems, Volume 11, Issue 4, pp. 189-226, 2015.

• Thanh H. Nguyen, Francesco M. Delle Fave, Debarun Kar, Aravind S. Lakshminarayanan, Amulya Yadav, Milind Tambe, Noa Agmon, Andrew J. Plumptre, Margaret Driciru, Fred Wanyama and Aggrey Rwetsiba. Making the most of Our Regrets: Regret-based Solutions to Handle Payoff Uncertainty and Elicitation in Green Security Games. In Proc. 6th Conference on Decision and Game Theory for Security, pp. 170-191, 2015.

• Amulya Yadav, Thanh Nguyen, Francesco Delle Fave, Milind Tambe, Noa Agmon, Manish Jain, Widodo Ramono and Timbul Batubara. Handling Payoff Uncertainty with Adversary Bounded Rationality in Green Security Domains. In Proc. 1st IJCAI Workshop on Algorithmic Game Theory, 2015.

• Eric Shieh, Albert Xin Jiang, Amulya Yadav, Pradeep Varakantham and Milind Tambe. Unleashing Dec-MDPs in Security Games: Enabling Effective Defender Teamwork. In Proc. 21st European Conference on Artificial Intelligence (ECAI), pp. 819-824, 2014.

• Thanh Hong Nguyen, Amulya Yadav, Bo An, Milind Tambe and Craig Boutilier. Regret-based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty. In Proc. 28th AAAI Conference on Artificial Intelligence, pp. 756-762, 2014.