In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probabilityw and losing the stake with probability 1−w, where 0 < w < 1 2 . The gambler seeks tomaximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins...