Expectation of the largest bet size in the Labouchere system

DOI10.1214/19-ECP220MaRDI QIDQ2631805zbMATH OpenFDO

Authors Yanjun Han, Guanyang Wang

Publication date 16 May 2019

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.11729, https://projecteuclid.org/euclid.ecp/1550826036

zbMATH Keywords

combinatoricsmartingalegambling theoryLabouchere system

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Abstract: For Labouchere system with winning probability $p$ at each coup, we prove that the expectation of the largest bet size under any initial list is finite if $p>frac12$, and is infinite if $plefrac12$, solving the open conjecture in Grimmett and Stirzaker (2001). The same result holds for a general family of betting systems, and the proof builds upon a recursive representation of the optimal betting system in the larger family.

Recommendations

• An extension of a theorem on gambling systems
• The assessment of large compounds of independent gambles
• The representative bettor, bet size, and prospect theory
• A strong limit theorem on gambling systems
• Calculating upper and lower probability bounds on the outcomes of large entry games
• Estimating risk preferences of bettors with different bet sizes
• The strong limit theorem of bounded gambling system
• Large games and the law of large numbers

Cites work

• scientific article; zbMATH DE number 1782874 (Why is no real title available?)
• Absorption Time Distribution for an Asymmetric Random Walk
• On the edge dimension of a graph
• The Doctrine of Chances

This page was built for publication: Expectation of the largest bet size in the Labouchere system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631805)