SearcharxivSearch

arXiv · 2009.09751

Convergence of Optimal Expected Utility for a Sequence of Binomial Models

Abstract

We analyze the convergence of expected utility under the approximation of the Black-Scholes model by binomial models. In a recent paper by D. Kreps and W. Schachermayer a surprising and somewhat counter-intuitive example was given: such a convergence may, in general, fail to hold true. This counterexample is based on a binomial model where the i.i.d. logarithmic one-step increments have strictly positive third moments. This is the case, when the up-tick of the log-price is larger than the down-tick. In the paper by D. Kreps and W. Schachermayer it was left as an open question how things behave in the case when the down-tick is larger than the up-tick and -- most importantly -- in the case of the symmetric binomial model where the up-tick equals the down-tick. Is there a general positive result of convergence of expected utility in this setting? In the present note we provide a positive answer to this question. It is based on some rather fine estimates of the convergence arising in the Central Limit Theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Friedrich Hubalek, Walter Schachermayer. 2020-09-21. Convergence of Optimal Expected Utility for a Sequence of Binomial Models. https://arxiv.org/abs/2009.09751

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR