SearcharxivSearch

arXiv · 2608.01300

Using the Cover Guessing Game Strategy to Predict the Results of Stochastic Processes

Abstract

Cover originally proposed a game in which Bob wrote two numbers on pieces of paper and allowed Alice to pick one and look at it. Cover then showed, as Blackwell is thought to have shown previously, that Alice has a strategy involving the selection of a random number which enables her to guess correctly with a probability greater than 0.5 which of the two numbers was larger. Central to Covers reasoning was that Alice could have picked either number to look at with equal probability. In this paper, we investigate the situation in which Bob obtains the two numbers as the result of an experiment based on a probability distribution, such as the spin of a roulette wheel. We then modify this to envision Alice and Bob conducting separate experiments based on probability distributions. Alice conducts one trial of her experiment and uses Covers strategy to guess whether the result from her experiment will be larger or smaller than the result from Bobs experiment whenever he chooses to conduct a single trial of it. The following two results are among those in the paper. (1) If the two numbers are observations of the same experiment, Alice merely has to observe one trial and apply the Cover strategy to have a probability greater than 0.5 of guessing the larger value, even if the second trial has not yet been conducted (2) There are many nontrivial examples where Alice and Bob conduct different experiments, and Alice can observe one trial of her experiment and apply the Cover strategy to have a probability greater than 0.5 of guessing the larger value, even if many of the specifics of the other experiment have not yet been determined and a trial of it has not yet been conducted.

Explore related subjects

Keep this discovery

BibTeXRIS

James D. Stein. 2026-08-02. Using the Cover Guessing Game Strategy to Predict the Results of Stochastic Processes. https://arxiv.org/abs/2608.01300

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