Sequential Valuation Networks for Asymmetric Decision Problems
View/ Open
Issue Date
2001-01Author
Demirer, Riza
Shenoy, Prakash P.
Publisher
University of Kansas School of Business
Format
904260 bytes
Type
Working Paper
Is part of series
School of Business Working Paper;No. 286
Rights
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Metadata
Show full item recordAbstract
This paper deals with representation and solution of asymmetric decision problems. We describe a new representation called sequential valuation networks that is a hybrid of Covaliu and Oliver’s sequential decision diagrams and Shenoy’s valuation networks. The solution algorithm is based on the idea of decomposing a large asymmetric problem into smaller sub-problems and then using the fusion algorithm of valuation networks to solve the sub-problems. Sequential valuation networks inherit many of the strengths of sequential decision diagrams and valuation networks while overcoming many of their
shortcomings. We illustrate our technique by representing and solving a modified version
of Covaliu and Oliver’s Reactor problem in complete detail.
Description
This paper is currently (August 2004) in press at the European Journal of Operational Research.
Collections
Citation
Demirer, R. and P. P. Shenoy (2001), "Sequential Valuation Networks for Asymmetric Decision Problems," Working Paper No. 286, Revised June 2004, School of Business, University of Kansas, Lawrence, KS.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.