SearcharxivSearch

arXiv · 2312.14445

Superhedging Supermartingales

Abstract

Supermartingales are here defined on a non-probabilistic setting and can be interpreted solely in terms of superhedging operations. The classical expectation operator is replaced by a pair of subadditive operators one of them providing a class of null sets and the other one acting as an outer integral. These operators are motivated by a financial theory of no-arbitrage pricing. Such a setting extends the classical stochastic framework by replacing the path space of the process by a trajectory set, while also providing a financial/gambling interpretation based on the notion of superhedging. The paper proves analogues of the following classical results: Doob's supermartingale decomposition and Doob's pointwise convergence theorem for nonnegative supermartingales. The approach shows how linearity of the expectation operator can be circumvented and how integrability properties in the proposed setting lead to the special case of (hedging) martingales while no integrability conditions are required for the general supermartingale case.

Explore related subjects

Keep this discovery

BibTeXRIS

C. Bender, S. E. Ferrando, K. Gajewski, A. L. Gonzalez. 2023-12-22. Superhedging Supermartingales. https://arxiv.org/abs/2312.14445

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