Two Procedures for Compiling Influence Diagrams

TL;DR

This paper introduces two algorithms that convert influence diagrams into simple decision rules, enabling quick, consistent, and near-optimal decision-making suitable for time-constrained human teams.

Contribution

The paper presents novel algorithms for compiling influence diagrams into decision rules, facilitating efficient decision procedures for complex, time-sensitive problems.

Findings

Algorithms produce simple, complete decision rules

Rules are near-optimal in decision quality

Applicable to human teams in time-constrained scenarios

Abstract

Two algorithms are presented for "compiling" influence diagrams into a set of simple decision rules. These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures. These compilation algorithms can be used to derive decision procedures for human teams solving time constrained decision problems.