Abstract

Influence diagrams are widely employed to represent multi-stage decision problems in which each decision is a choice from a discrete set of alternative courses of action, uncertain chance events have discrete outcomes, and prior decisions may influence the probability distributions of uncertain chance events endogenously. In this paper, we develop the Decision Programming framework which extends the applicability of influence diagrams by developing mixed-integer linear programming formulations for such problems. In particular, Decision Programming makes it possible to (i) solve problems in which earlier decisions cannot necessarily be recalled later, for instance, when decisions are taken by agents who cannot communicate with each other; (ii) accommodate a broad range of deterministic and chance constraints, including those based on resource consumption, logical dependencies or risk measures such as Conditional Value-at-Risk; and (iii) determine all non-dominated decision strategies in problems which multiple value objectives. In project portfolio selection problems, Decision Programming allows scenario probabilities to depend endogenously on project decisions and can thus be viewed as a generalization of Contingent Portfolio Programming (Gustafsson & Salo, 2005). We present several illustrative examples, evidence on the computational performance of Decision Programming formulations, and directions for further development.

Highlights

  • Influence diagrams, in their many variants, are widely employed to represent decision problems whose consequences depend on uncertain chance events and decisions

  • Such decisions and chance events are represented by decision and chance nodes in an acyclic graph whose arcs indicate (i) what information is available to the decision maker (DM) and (ii) how realizations of chance events depend on earlier decisions and chance events

  • We develop the Decision Programming framework which uses the graphical representation of influence diagrams to capture the salient properties of multi-stage decision problems under uncertainty

Read more

Summary

Introduction

In their many variants (see, e.g., Bielza, Gómez, & Shenoy, 2011; Diehl & Haimes, 2004; Díez, Luque, & Bermejo, 2018; Howard & Matheson, 1984; Howard & Matheson, 2005), are widely employed to represent decision problems whose consequences depend on uncertain chance events and decisions. We develop the Decision Programming framework which uses the graphical representation of influence diagrams to capture the salient properties of multi-stage decision problems under uncertainty The inputs of this framework consist of (i) the problem structure, represented by a connected, acyclic directed graph consisting of decision, chance and value nodes as well as informational and probabilistic dependencies between these, shown through arcs; (ii) discrete sets of states that represent the set of possible decisions at each decision node and the possible realisation of chance events at chance nodes; (iii) numerical parameters, such as probabilities at chance nodes and consequences (or their utilities) at value nodes.

Earlier approaches
Influence diagram representation of the decision problem
Characterizing path probabilities using linear inequalities
Maximization of expected utility
An improved MILP formulation
Computational complexity
Valid constraints
Decision programming without the no-forgetting assumption
Extensions to modeling chance constraints and multiple value nodes
Absolute and lower-semi absolute deviation
Chance constraints and Value-at-Risk
Conditional Value-at-Risk
Multiple value nodes and objectives
Computational experiments
N-monitoring problem
The pig farm problem
Findings
Summary and conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call