The most exciting game
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) and finally 0 or 1. As an idealization we take a continuous time interval [0,1] and consider the process M=(Mt)t∈ [0,1] giving the probability at time t 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 M of this type, where `most random' is interpreted as a maximal entropy criterion. We observe that this max-entropy win-martingale M also minimizes specific relative entropy with respect to Brownian motion in the sense of Gantert and use this to prove that M is characterized by the stochastic differential equation dMt = (π Mt ) π 1-t\, dBt. 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.