English

The most exciting game

Probability 2023-07-04 v2 Optimization and Control

Abstract

Motivated by a problem posed by Aldous, our goal is to find the maximal-entropy win-martingale: In a sports game between two teams, the chance the home team wins is initially x0(0,1)x_0 \in (0,1) and finally 0 or 1. As an idealization we take a continuous time interval [0,1][0,1] and consider the process M=(Mt)t[0,1]M=(M_t)_{t\in [0,1]} giving the probability at time tt that the home team wins. This is a martingale which we idealize further to have continuous paths. We consider the problem to find the most random martingale MM of this type, where `most random' is interpreted as a maximal entropy criterion. We observe that this max-entropy win-martingale MM also minimizes specific relative entropy with respect to Brownian motion in the sense of Gantert and use this to prove that MM is characterized by the stochastic differential equation dMt=sin(πMt)π1tdBt. dM_t = \frac{\sin (\pi M_t )} {\pi\sqrt {1-t}}\, dB_t. To derive the form of the optimizer we use a scaling argument together with a new first order condition for martingale optimal transport which may be of interest in its own right.

Keywords

Cite

@article{arxiv.2305.14037,
  title  = {The most exciting game},
  author = {Julio Backhoff-Veraguas and Mathias Beiglboeck},
  journal= {arXiv preprint arXiv:2305.14037},
  year   = {2023}
}

Comments

Added references to related works in the literature and especially to the recent work by Guo, Possamai and Reisinger

R2 v1 2026-06-28T10:42:57.940Z