An axiomatic framework for influence diagram computation with partially ordered utilities
This paper presents an axiomatic framework for influence diagram computation, which allows reasoning with partially ordered values of utility. We show how an algorithm based on sequential variable elimination can be used to compute the set of maximal values of expected utility (up to an equivalence relation). Formalisms subsumed by the framework include decision making under uncertainty based on multi-objective utility, or on interval-valued utilities, as well as a more qualitative decision theory based on order-of-magnitude probabilities and utilities.
Axiomatic framework , Influence diagram computation , Algorithm , Sequential variable , Partially ordered utilities
WILSON, N.and MARINESCU, R. 2012. An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities’. Thirteenth International Conference on the Principles of Knowledge Representation and Reasoning (KR 2012). University of Rome, Rome, 10-14 June 2012. Available at: <http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4514>.
© 1995–2013 Association for the Advancement of Artificial Intelligence.