|
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/967
|
|
View usage statistics
|
Full metadata record
| DC Field | Value | Language |
|---|
| dc.contributor.author | Jensen, Finn V. | - |
| dc.contributor.author | Nielsen, Thomas D. | - |
| dc.contributor.author | Shenoy, Prakash P. | - |
| dc.date.accessioned | 2006-05-17T16:31:19Z | - |
| dc.date.available | 2006-05-17T16:31:19Z | - |
| dc.date.issued | 2006-05 | - |
| dc.identifier.citation | Jensen, F. V., T. D. Nielsen, and P. P. Shenoy, "Sequential influence diagrams: A unified asymmetry framework," International Journal of Approximate Reasoning, Vol. 42, Nos. 1--2, 2006, pp. 101--118. | en |
| dc.identifier.issn | 0888-613X | - |
| dc.identifier.uri | http://hdl.handle.net/1808/967 | - |
| dc.description.abstract | We describe a new graphical language for specifying asymmetric decision problems. The language is based on a filtered merge of several existing languages including sequential valuation networks, asymmetric influence diagrams, and unconstrained influence diagrams. Asymmetry is encoded using a structure resembling a clustered decision tree, whereas the representation of the uncertainty model is based on the (unconstrained) influence diagram framework. We illustrate the proposed language by modeling several highly asymmetric decision problems, and we describe an efficient solution procedure. | en |
| dc.format.extent | 313928 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en | en |
| dc.publisher | Elsevier Inc. | en |
| dc.subject | Asymmetric decision problems | en |
| dc.subject | influence diagrams | en |
| dc.subject | sequential valuation networks | en |
| dc.subject | unconstrained influence diagrams | en |
| dc.title | Sequential influence diagrams: A unified asymmetry framework | 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