How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 1 figure

Scientific paper

Consider a gambling game in which we are allowed to repeatedly bet a portion of our bankroll at favorable odds. We investigate the question of how to minimize the expected number of rounds needed to increase our bankroll to a given target amount. Specifically, we disprove a 50-year old conjecture of L. Breiman, that there exists a threshold strategy that optimizes the expected number of rounds; that is, a strategy that always bets to try to win in one round whenever the bankroll is at least a certain threshold, and that makes Kelly bets (a simple proportional betting scheme) whenever the bankroll is below the threshold.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-393329

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.