ABSTRACT
We consider the convergence of the solution of a discrete-time utility maximization problem for a sequence of binomial models to the Black-Scholes-Merton model for general utility functions. In previous work by D. Kreps and the second named author a counter-example for positively skewed non-symmetric binomial models has been constructed, while the symmetric case was left as an open problem. In the present article we show that convergence holds for the symmetric case and for negatively skewed binomial models. The proof depends on some rather fine estimates of the tail behaviors of binomial random variables. We also review some general results on the convergence of discrete models to Black-Scholes-Merton as developed in a recent monograph by D. Kreps.
