Name
Abstract | ||
|---|---|---|
Humans routinely confront the following key question which could be viewed as a probabilistic variant of the controllability problem: While faced with an uncertain environment governed by causal structures, how should they practice their autonomy by intervening on driver variables, in order to increase (or decrease) the probability of attaining their desired (or undesired) state for some target variable? In this paper, for the first time, the problem of probabilistic controllability in Causal Bayesian Networks (CBNs) is studied. More specifically, the aim of this paper is two-fold: (i) to introduce and formalize the problem of probabilistic controllability in CBNs, and (ii) to identify a sufficient set of driver variables for the purpose of probabilistic controllability of a generic CBN. We also elaborate on the nature of minimality the identified set of driver variables satisfies. In this context, the term structural signifies the condition wherein solely the structure of the CBN is known. |
Year | Venue | DocType |
|---|---|---|
2015 | arXiv: Artificial Intelligence | Journal |
Volume | Citations | PageRank |
abs/1512.01885 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ardavan Salehi Nobandegani | 1 | 1 | 6.10 |
| Ioannis N. Psaromiligkos | 2 | 117 | 15.36 |