SearcharxivSearch

arXiv · 2503.06856

Grab It Before It's Gone: Testing Uncertain Rewards under a Stochastic Deadline

Abstract

We study a sequential estimation problem for an unknown reward in the presence of a random horizon. The reward takes one of two predetermined values that can be inferred from the drift of a Wiener process, which serves as a signal. The objective is to use the information in the signal to estimate the reward which is made available until a stochastic deadline that \textit{depends} on its value. The observer must therefore work quickly to determine if the reward is favorable and claim it before the deadline passes. Under general assumptions on the stochastic deadline, we provide a full characterization of the solution that includes an identification with the unique solution to a free-boundary problem. Our analysis derives regularity properties of the solution that imply its ``smooth fit'' with the boundary data, and shows that the free-boundary solves a particular integral equation. The continuity of the free-boundary is also established under additional structural assumptions that lead to its representation in terms of a continuous transformation of a monotone function. We provide illustrations for several examples of interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven Campbell, Georgy Gaitsgori, Richard Groenewald, Ioannis Karatzas. 2025-03-10. Grab It Before It's Gone: Testing Uncertain Rewards under a Stochastic Deadline. https://arxiv.org/abs/2503.06856

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