Expectation of the Largest Betting Size in Labouchère System

07/31/2018
by   Yanjun Han, et al.
0

For Labouchère system with winning probability p at each coup, we prove that the expectation of the largest betting size under any initial list is finite if p>1/2, and is infinite if p<1/2, solving the open conjecture in grimmett2001one. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2019

Thresholds versus fractional expectation-thresholds

Proving a conjecture of Talagrand, a fractional version of the 'expectat...
research
06/03/2022

Erdős Matching Conjecture for almost perfect matchings

In 1965 Erdős asked, what is the largest size of a family of k-elements ...
research
01/26/2019

Beyond the Erdős Matching Conjecture

A family F⊂[n] k is U(s,q) of for any F_1,..., F_s∈ F we have |F_1∪...∪...
research
08/19/2019

Computation of the largest Lyapunov exponent using recursive estimation with variable factor

Chaotic systems have been investigated in the most diverse areas. One of...
research
06/28/2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams

Ferrers diagram rank-metric codes were introduced by Etzion and Silberst...
research
04/18/2020

Intersection theorems for (-1,0,1)-vectors

In this paper, we investigate Erdős–Ko–Rado type theorems for families o...
research
04/21/2022

On a conjecture of Talagrand on selector processes and a consequence on positive empirical processes

For appropriate Gaussian processes, Michel Talagrand (1987) proved that ...

Please sign up or login with your details

Forgot password? Click here to reset