SearcharxivSearch

arXiv · 2306.07133

Randomness and early termination: what makes a game exciting?

Abstract

In this paper we revisit an open problem posed by Aldous on the max-entropy win-probability martingale: given two players of equal strength, such that the win-probability is a martingale diffusion, which of these processes has maximum entropy and hence gives the most excitement for the spectators? We study a terminal-boundary value problem for the nonlinear parabolic PDE $2\partial_te(t,x)=\log(-\partial_{xx}e(t,x))$ derived by Aldous and prove its wellposedness and regularity of its solution by combining PDE analysis and probabilistic tools, in particular the reformulation as a stochastic control problem with restricted control set, which allows us to deduce strict ellipticity. We establish key qualitative properties of the solution including concavity, monotonicity, convergence to a steady state for long remaining time and the asymptotic behaviour shortly before the terminal time. Moreover, we construct convergent numerical approximations. The analytical and numerical results allow us to highlight the behaviour of the win-probability process in the present case where the match may end early, in contrast to recent work by Backhoff-Veraguas and Beiglb\"ock where the match always runs the full length.

Explore related subjects

Keep this discovery

BibTeXRIS

Gaoyue Guo, Sam D. Howison, Dylan Possamaï, Christoph Reisinger. 2023-06-12. Randomness and early termination: what makes a game exciting?. https://arxiv.org/abs/2306.07133

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