Two Procedures for Compiling Influence Diagrams

03/06/2013
by   Paul E. Lehner, et al.
0

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.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

page 5

page 6

02/27/2013

Solving Asymmetric Decision Problems with Influence Diagrams

While influence diagrams have many advantages as a representation framew...
02/13/2013

A Graph-Theoretic Analysis of Information Value

We derive qualitative relationships about the informational relevance of...
12/17/2013

Sistem pendukung keputusan kelayakan TKI ke luar negeri menggunakan FMADM

BP3TKI Palembang is the government agencies that coordinate, execute and...
02/13/2013

Some Experiments with Real-Time Decision Algorithms

Real-time Decision algorithms are a class of incremental resource-bounde...
07/04/2021

Attribute reduction and rule acquisition of formal decision context based on two new kinds of decision rules

This paper mainly studies the rule acquisition and attribute reduction f...
12/12/2012

Unconstrained Influence Diagrams

We extend the language of influence diagrams to cope with decision scena...
02/27/2013

From Influence Diagrams to Junction Trees

We present an approach to the solution of decision problems formulated a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.