Computational efficiency in multivariate adversarial risk analysis models
From MaRDI portal
Abstract: In this paper we address the computational feasibility of the class of decision theoretic models referred to as adversarial risk analyses (ARA). These are models where a decision must be made with consideration for how an intelligent adversary may behave and where the decision-making process of the adversary is unknown, and is elicited by analyzing the adversary's decision problem using priors on his utility function and beliefs. The motivation of this research was to develop a computational algorithm that can be applied across a broad range of ARA models; to the best of our knowledge, no such algorithm currently exists. Using a two-person sequential model, we incrementally increase the size of the model and develop a simulation-based approximation of the true optimum where an exact solution is computationally impractical. In particular, we begin with a relatively large decision space by considering a theoretically continuous space that must be discretized. Then, we incrementally increase the number of strategic objectives which causes the decision space to grow exponentially. The problem is exacerbated by the presence of an intelligent adversary who also must solve an exponentially large decision problem according to some unknown decision-making process. Nevertheless, using a stylized example that can be solved analytically we show that our algorithm not only solves large ARA models quickly but also accurately selects to the true optimal solution. Furthermore, the algorithm is sufficiently general that it can be applied to any ARA model with a large, yet finite, decision space.
Recommendations
Cites work
- Adversarial risk analysis
- Adversarial risk analysis: the Somali pirates case
- Balancing Terrorism and Natural Disasters—Defensive Strategy with Endogenous Attacker Effort
- Communication and Coordination in Social Networks
- Decision analysis by augmented probability simulation
- Dynamic sampling allocation and design selection
- Games with Incomplete Information Played by ‘Bayesian’ Players, Part III. The Basic Probability Distribution of the Game
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
- scientific article; zbMATH DE number 3026527 (Why is no real title available?)
- Indifference-Zone-Free Selection of the Best
- Information Manipulation, Coordination, and Regime Change*
- MO\(^{2}\)TOS: multi-fidelity optimization with ordinal transformation and optimal sampling
- Multi-agent influence diagrams for representing and solving games.
- Network routing for insurgency: an adversarial risk analysis framework
- Overthrowing the dictator: a game-theoretic approach to revolutions and media
- Rejoinder to the discussion of `Adversarial risk analysis: Borel games'
- Robust adversarial risk analysis: a level-k approach
- Sequential sampling to myopically maximize the expected value of information
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Target-hardening decisions based on uncertain multiattribute terrorist utility
Cited in
(3)
This page was built for publication: Computational efficiency in multivariate adversarial risk analysis models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121290)
