Enum nice_smile::network::InfluenceDiagramAlgorithm

pub enum InfluenceDiagramAlgorithm {
    PolicyEvaluation,
    BestPolicySearch,
}

Influence Diagram algorithms

Variants

PolicyEvaluation

The policy evaluation algorithm solves an influence diagram by first transforming it into a super::Network and then finding the expected utilities of each of the decision alternatives by performing repeated inference in this network. The algorithm will result in a full set of expected utilities for all possible policies in the network.

The policy evaluation algorithm uses the default BayesianNetworkAlgorithm or one specified by super::Network::set_bayesian_network_algorithm. This may have an impact on both the computational performance and the accuracy of the computation.

This may be a computationally intensive process for large influence diagrams. If you are not interested in the values of expected utilities, but would just like to know the optimal decision at the highest level, consider using the InfluenceDiagramAlgorithm::BestPolicySearch algorithm for finding the best policy.

For more information, refer to https://support.bayesfusion.com/docs/GeNIe/algorithms_cooper.html.

BestPolicySearch

The best policy search algorithm solves an influence diagram by finding just the best policy in the network.

The algorithm instantiates the first decision node to the optimal decision alternative but does not produce the numerical expected utility of this or any other decision option.

In order for this algorithm to be run, all informational predecessors of the first decision node have to be instantiated.

For more information, refer to https://support.bayesfusion.com/docs/GeNIe/algorithms_shachterpeot.html.