Using Binomial Decision Trees to Solve Real-Option Valuation Problems

Abstract

Traditional decision analysis methods can provide an intuitive approach to valuing projects with managerial flexibility or real options. The discrete-time approach to real-option valuation has typically been implemented in the finance literature using a binomial lattice framework. Instead, we use a binomial decision tree with risk-neutral probabilities to approximate the uncertainty associated with the changes in the value of a project over time. Both methods are based on the same principles, but we use dynamic programming to solve the binomial decision tree, thereby providing a computationally intensive but simpler and more intuitive solution. This approach also provides greater flexibility in the modeling of problems, including the ability to include multiple underlying uncertainties and concurrent options with complex payoff characteristics.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 246 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.