Attack-defense trees and two-player binary zero-sum extensive form games are equivalent. (English) Zbl 1298.91066
Alpcan, Tansu (ed.) et al., Decision and game theory for security. First international conference, GameSec 2010, Berlin, Germany, November 22–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17196-3/pbk). Lecture Notes in Computer Science 6442, 245-256 (2010).
Summary: Attack-defense trees are used to describe security weaknesses of a system and possible countermeasures. In this paper, the connection between attack-defense trees and game theory is made explicit. We show that attack-defense trees and binary zero-sum two-player extensive form games have equivalent expressive power when considering satisfiability, in the sense that they can be converted into each other while preserving their outcome and their internal structure.
For the entire collection see [Zbl 1200.68002].
For the entire collection see [Zbl 1200.68002].
MSC:
| 91A80 | Applications of game theory |
| 68P25 | Data encryption (aspects in computer science) |
| 91A05 | 2-person games |
| 91A18 | Games in extensive form |
