Folding Back in Decision Tree Analysis

Rakesh Sarin and Peter Wakker
Additional contact information
Rakesh Sarin: Anderson Graduate School of Management, University of California, 405 Hilgard Avenue, Los Angeles, California 90024-1481

Management Science, 1994, vol. 40, issue 5, 625-628

Abstract: This note demonstrates that two minimal requirements of decision tree analysis, the folding back procedure and the interchangeability of consecutive event nodes, imply independence.

Keywords: decision analysis; dynamic choice (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.40.5.625 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:40:y:1994:i:5:p:625-628

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().