1. B. Bosansky, C. Kiekintveld, V. Lisy, J. Cermak, and M. Pechoucek. Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games. InProceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2013), 2013
2. A. Buldas and R. Stepanenko. Upper bounds for adversaries’ utility in attack trees. In J. Grossklags and J. Walrand, editors,Decision and Game Theory for Security, volume 7638 of Lecture Notes in Computer Science, pages 98–117. Springer Berlin Heidelberg, 2012.
3. C. F. Camerer.Behavioral Game Theory: Experiments in Strategic Interaction. Princeton University Press, 2003.
4. F. Cohen. A mathematical structure of simple defensive network deception.Computers & Security, 19(6):520–528, 2000.
5. M. Dornseif and T. Holz. Nosebreak-attacking honeynets. In2004 IEEE Workshop on Information Assurance and Security, 2004.