257 followers
New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees (Buldas, Lenin) http://t.co/J70t7Uwg0w
Decision and Game Theory for Security
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 On Communication over Gaussian Sensor Networks with Adversaries: Further Results
-
Altmetric BadgeChapter 2 A True Random Generator Using Human Gameplay
-
Altmetric BadgeChapter 3 A Game Theoretic Analysis of Collaboration in Wikipedia
-
Altmetric BadgeChapter 4 Controllability of Dynamical Systems: Threat Models and Reactive Security
-
Altmetric BadgeChapter 5 Adaptive Regret Minimization in Bounded-Memory Games
-
Altmetric BadgeChapter 6 The Cooperative Ballistic Missile Defence Game
-
Altmetric BadgeChapter 7 Security Games for Virtual Machine Allocation in Cloud Computing
-
Altmetric BadgeChapter 8 Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers
-
Altmetric BadgeChapter 9 Defeating Tyranny of the Masses in Crowdsourcing: Accounting for Low-Skilled and Adversarial Workers
-
Altmetric BadgeChapter 10 Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity
-
Altmetric BadgeChapter 11 Mitigation of Targeted and Non-targeted Covert Attacks as a Timing Game
-
Altmetric BadgeChapter 12 New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees
-
Altmetric BadgeChapter 13 Optimizing Active Cyber Defense
-
Altmetric BadgeChapter 14 Equilibrium Concepts for Rational Multiparty Computation
-
Altmetric BadgeChapter 15 Game-Theoretic Approach to Feedback-Driven Multi-stage Moving Target Defense
Attention for Chapter 12:
New Efficient Utility Upper Bounds for the Fully Adaptive Model of Attack Trees