|
KU ScholarWorks >
School of Business >
School of Business Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1808/173
|
|
View usage statistics
|
Full metadata record
| DC Field | Value | Language |
|---|
| dc.contributor.author | Shenoy, Prakash P. | - |
| dc.date.accessioned | 2004-12-19 | - |
| dc.date.available | 2004-12-19 | - |
| dc.date.issued | 1998-04 | - |
| dc.identifier.citation | Shenoy, P. P., "Game Trees for Decision Analysis," Theory and Decision, Vol. 44, No. 2, April 1998, pp. 149--171. | en |
| dc.identifier.issn | 0040-5833 | - |
| dc.identifier.uri | http://hdl.handle.net/1808/173 | - |
| dc.description.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. | en |
| dc.format.extent | 153650 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | Kluwer Academic Publishers | en |
| dc.subject | Game trees | en |
| dc.subject | Decision trees | en |
| dc.subject | Influence diagrams | en |
| dc.subject | Valuation networks | en |
| dc.subject | Roll-back method | en |
| dc.title | Game Trees for Decision Analysis | en |
| dc.type | Article | en |
| Appears in Collections: | School of Business Articles
|
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
|
top