Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
2-2019
Abstract
Allocating resources to defend targets from attack is often complicated by uncertainty about the attacker’s capabilities, objectives, or other underlying characteristics. In a repeated interaction setting, the defender can collect attack data over time to reduce this uncertainty and learn an effective defense. However, a clever attacker can manipulate the attack data to mislead the defender, influencing the learning process toward its own benefit. We investigate strategic deception on the part of an attacker with private type information, who interacts repeatedly with a defender. We present a detailed computation and analysis of both players’ optimal strategies given the attacker may play deceptively. Computational experiments illuminate conditions conducive to strategic deception, and quantify benefits to the attacker. By taking into account the attacker’s deception capacity, the defender can significantly mitigate loss from misleading attack actions.
Discipline
Computer and Systems Architecture | Software Engineering
Research Areas
Data Science and Engineering
Publication
Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), Honolulu, Hawaii, January 27 - February 1
First Page
2133
Last Page
2140
Identifier
10.1609/aaai.v33i01.33012133
Publisher
AAAI Press
City or Country
Honolulu, Hawaii, USA
Citation
NGUYEN, Thanh H.; WANG, Yongzhao; SINHA, Arunesh; and WELLMAN, Michael P..
Deception in finitely repeated security games. (2019). Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), Honolulu, Hawaii, January 27 - February 1. 2133-2140.
Available at: https://ink.library.smu.edu.sg/sis_research/4795
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1609/aaai.v33i01.33012133