![]() |
Tom Hayes
|
I am a Research Assistant Professor at TTI-Chicago. Most of my research is in
Theoretical Computer Science
and Discrete Mathematics. I recently completed a postdoctoral
fellowship in the UC Berkeley
Computer Science Division.
I did my graduate work at the University
of Chicago, just minutes away from TTI-C.
This is a graph of the maximum probability of winning $X in a sequence of n bets on fair propositions, when the maximum win or loss is constained to be at most $1, assuming optimal strategy. The curves shown are for n = 1, 2, ..., 7 (regions between curves have been filled in for aesthetic reasons). If this piques your curiosity, read the paper (sorry, it's black and white).