University of California at Berkeley. Presidential address to the American Finance Association, January 1994, Boston, Massachusetts. I would like to give special thanks to Jack Hirshleifer, who while he has not commented specifically on this article, nonetheless as my mentor in my formative years, propelled me in its direction. William Keirstead, while he has been a Ph.D. student at Berkeley, has helped implement the nonlinear programming algorithms described in this article. I am also grateful for recent conversations with Hua He, John Hull, Hayne Leland, and Alan White, and earlier conversations with Ray Hawkins and David Shimko.
Implied Binomial Trees
Article first published online: 30 APR 2012
1994 The American Finance Association
The Journal of Finance
Volume 49, Issue 3, pages 771–818, July 1994
How to Cite
RUBINSTEIN, M. (1994), Implied Binomial Trees. The Journal of Finance, 49: 771–818. doi: 10.1111/j.1540-6261.1994.tb00079.x
- Issue published online: 30 APR 2012
- Article first published online: 30 APR 2012
This article develops a new method for inferring risk-neutral probabilities (or state-contingent prices) from the simultaneously observed prices of European options. These probabilities are then used to infer a unique fully specified recombining binomial tree that is consistent with these probabilities (and, hence, consistent with all the observed option prices). A simple backwards recursive procedure solves for the entire tree. From the standpoint of the standard binomial option pricing model, which implies a limiting risk-neutral lognormal distribution for the underlying asset, the approach here provides the natural (and probably the simplest) way to generalize to arbitrary ending risk-neutral probability distributions.