Game Trees For Decision Analysis

Theory and Decision 44 (2):149-171 (1998)
  Copy   BIBTEX

Abstract

Game trees (or extensive-form games) were first defined by von Neumann and Morgenstern in 1944. In this paper we examine the use of game trees for representing Bayesian decision problems. We propose a method for solving game trees using local computation. This method is a special case of a method due to Wilson for computing equilibria in 2-person games. Game trees differ from decision trees in the representations of information constraints and uncertainty. We compare the game tree representation and solution technique with other techniques for decision analysis such as decision trees, influence diagrams, and valuation networks.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Ordinal preference representations.Niall M. Fraser - 1994 - Theory and Decision 36 (1):45-67.
複合属性による領域分割を用いた決定木 Dtmacc.Inazumi Hiroshige Kushi Yusuke - 2002 - Transactions of the Japanese Society for Artificial Intelligence 17:44-52.
Games, trees and deontic logic.Bartosz Brożek - 2011 - In Jerzy Stelmach & Wojciech Załuski (eds.), Game theory and the law. Kraków: Copernicus Center Press.
共生進化に基づく簡素な決定木の生成.志村 正道 大谷 紀子 - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:399-404.
Causing harm: Criminal law. [REVIEW]Philip Mullock - 1988 - Law and Philosophy 7 (1):67 - 105.

Analytics

Added to PP
2010-09-02

Downloads
8 (#517,646)

6 months
74 (#216,861)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Sequential Equilibria.David Kreps - 1982 - Econometrica 50:863-894.

Add more references