SearcharxivSearch

arXiv · 2608.12291

When should one stop the most exciting game? Sequential Inference for win-martingales

Abstract

Prediction markets have become a prominent way of aggregating beliefs about binary future events, and their price processes are often interpreted as evolving win probabilities, or ``win-martingales.'' Motivated by this perspective and recent work on Aldous' ``most exciting game,'' we study when a decision maker should stop observing a win-martingale and make a decision about the outcome. In particular, we allow the true outcome to be revealed at a fixed finite horizon, as in a sports game or election. Under a general terminal loss and running cost, we reduce the Bayes risk to an optimal stopping problem for the win probability process. When the win-martingale is a diffusion and its volatility separates into a deterministic time factor and a state-dependent factor, a deterministic time change transforms the problem into one for a time-homogeneous diffusion with a generally time-inhomogeneous running cost. Under explicit structural assumptions, we obtain a complete free-boundary characterization of the solution to the stopping problem in both finite and infinite horizons without discounting. We prove smooth-fit and $C^1$ regularity of the value function, $C^1$ regularity of the optimal stopping boundaries before the horizon, and derive a nonlinear integral equation that characterizes the boundaries uniquely. Taken together, these results yield a common decision-theoretic framework and solution theory for a broad class of posterior dynamics that includes the Aldous, Bass, and binary sequential-inference martingales as special cases. Our analysis requires no temporal monotonicity of the running cost and therefore accommodates highly nonmonotone stopping boundaries. In particular, we exhibit an example in which the optimal boundary has no limit as the calendar-time horizon is approached.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven Campbell, Karl Kristian Engelund. 2026-08-12. When should one stop the most exciting game? Sequential Inference for win-martingales. https://arxiv.org/abs/2608.12291

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