Expected Utility Networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: La Mura, Pierfrancesco, Shoham, Yoav
Natura: Preprint
Pubblicazione: 2013
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913198227062784
author La Mura, Pierfrancesco
Shoham, Yoav
author_facet La Mura, Pierfrancesco
Shoham, Yoav
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_1301_6714
institution arXiv
publishDate 2013
record_format arxiv
spellingShingle Expected Utility Networks
La Mura, Pierfrancesco
Shoham, Yoav
Computer Science and Game Theory
Artificial Intelligence
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.
title Expected Utility Networks
topic Computer Science and Game Theory
Artificial Intelligence
url https://arxiv.org/abs/1301.6714