2011/12/07 by Shalosh B. Ekhad, Doron Zeilberger · 2 voices
Computer Science · Mathematics · #cs.GT #math.PR
published as Journal of Difference Equations and Application, 19(2013) , 520-526 · 6 pages; accompanied by a Maple package at http://www.math.rutgers.edu/~zeilberg/tokhniot/HIMURIM ; This version removes the name of the former second-named author by his own request
arxiv created 2014/11/26 · arxiv updated 2014/11/27
The beautiful theory of statistical gambling, started by Dubins and Savage (for subfair games) and continued by Kelly and Breiman (for superfair games) has mostly been studied under the unrealistic assumption that we live in a continuous world, that money is indefinitely divisible, and that our life is indefinitely long. Here we study these fascinating problems from a purely discrete, finitistic, and computational, viewpoint, using Both Symbol-Crunching and Number-Crunching (and simulation just for checking purposes).