Probabilistic decision graphs for optimization under uncertainty

Abstract

This paper provides a survey on probabilistic decision graphs for modeling and solving decision problems under uncertainty. We give an introduction to influence diagrams, which is a popular framework for representing and solving sequential decision problems with a single decision maker. As the methods for solving influence diagrams can scale rather badly in the length of the decision sequence, we present a couple of approaches for calculating approximate solutions. The modeling scope of the influence diagram is limited to so-called symmetric decision problems. This limitation has motivated the development of alternative representation languages, which enlarge the class of decision problems that can be modeled efficiently. We present some of these alternative frameworks and demonstrate their expressibility using several examples. Finally, we provide a list of software systems that implement the frameworks described in the paper.

Physarum solver: a bio-inspired method for sustainable supply chain network design problem

“…Besides, some available theories, e.g. evidence theory, probabilistic graphs, have been leveraged to address the uncertainty arising in various optimization problems (Jensen and Nielsen 2013;Jiang et al 2016a, b;Ning et al 2016;Yao et al 2013).…”

Autonomous agents modelling other agents: A comprehensive survey and open problems

“…Graphical models can represent sequential interactions by adding additional nodes for each time step in the interaction, as well as dependencies between nodes in different time steps(Jensen and Nielsen, 2011). Unfortunately, this approach does not scale efficiently with the number of time steps (e.g Gal and Pfeffer, 2003b)…”