We introduce a new class of graphical representations, expected utility networks (EUNs), and discuss some of its properties and potential applications to artificial intelligence and economic theory.
In EUNs not only probabilities, but also utilities enjoy a modular representation. EUNs are undirected graphs with two types of arc, representing probability and utility dependencies respectively. The representation of utilities is based on a novel notion of conditional utility independence, which we introduce and discuss in the context of other existing proposals.
Just as probabilistic inference involves the computation of conditional probabilities, strategic inference involves the computation of conditional expected utilities for alternative plans of action. We define a new notion of conditional expected utility (EU) independence, and show that in EUNs node separation with respect to the probability and utility subgraphs implies conditional EU independence.
[1]
Yoav Shoham,et al.
Conditional, Hierarchical, Multi-Agent Preferences
,
1998,
TARK.
[2]
Judea Pearl,et al.
GRAPHOIDS: A Graph-based logic for reasoning about relevance relations
,
1985
.
[3]
David C. Hogg,et al.
Advances in Artificial Intelligence-II
,
1987
.
[4]
Fahiem Bacchus,et al.
Graphical models for preference and utility
,
1995,
UAI.
[5]
Judea Pearl,et al.
Probabilistic reasoning in intelligent systems
,
1988
.
[6]
Judea Pearl,et al.
GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations OrWhen Would x Tell You More about y If You Already Know z?
,
1986,
ECAI.
[7]
Judea Pearl,et al.
Probabilistic reasoning in intelligent systems - networks of plausible inference
,
1991,
Morgan Kaufmann series in representation and reasoning.