| SBR Top-Rated Sportsbooks Recommended Books | ||
| 1. Pinnacle Sports | SBR Rating A+ | Pinnacle Sports Review |
| 2. The Greek Sports Book | SBR Rating A+ | The Greek Review |
| 3. BookMaker | SBR Rating A+ | BookMaker Review |
| 4. BetJamaica | SBR Rating A+ | BetJamaica Review |
| 5. LegendZ Sports | SBR Rating A+ | LegendZ Review |
| SBR Posters' Poll - March 2009 View Complete Results | ||
| 1. BetJamaica | 251 total points | BetJamaica Review |
| 2. The Greek Sports Book | 217 total points | The Greek Review |
| 3. 5Dimes | 181 total points | 5Dimes Review |
| 4. Matchbook | 159 total points | Matchbook Review |
| 5. Pinnacle Sports | 148 total points | Pinnacle Sports Review |
![]() |
View New Posts |
|
|
LinkBack | Thread Tools |
|
|
#1 | ||||
|
I'm having trouble managing to implement Kelly Criterion for wagers that are correlated such as Basic Strategy Teasers. If I bet Kelly units... How would I allocate my bankroll from ranging from 2-6 teamers each weekend?
|
||||
|
|
#2 | ||||
|
SBR Problem Poster 2007-08
|
I've just paged Ganchrow for you.
|
||||
|
|
#3 | ||||
|
Heh. Maybe I should've just PMed him.
I've looked into it a shade. Would be interested in any ideas for approximations as well. I came up with some rough figures, but would atleast like a second opinion before I move forward with my bastardized math. |
||||
|
|
#4 | ||||
|
I was gonna say I would have if you didn't already do it.
__________________
Enjoying retirement. |
||||
|
|
#5 | |||||
|
Quote:
In the case of 3 candidates, with win probabilities p1, p2, and p3, and teasers that payout at decimal odds of o2 for 2-team parlays and o3 for 3-team parlays, utility as a function of the weightings of the three 2-team teasers (x12, x13, x23) and the one 3-team teasers would look like this: U(x12,x13,x23,x123) = p1*p2*p3*log(1+(o2-1)*(x12+x13+x23) + (o3-1)*x123) + p1*p2*(1-p3)*log(1+(o2-1)*x12 - x13 - x23 - x123) + p1*p3*(1-p2)*log(1+(o2-1)*x13 - x12 - x23 - x123) + p2*p3*(1-p1)*log(1+(o2-1)*x23 - x13 - x12 - x123) + [p1*(1-p2)*(1-p3) + p2*(1-p1)*(1-p3) + p3*(1-p1)*(1-p2) + (1-p1)*(1-p2)*(1-p3)] *log(1-x12 - x13 - x23 - x123) U is then of course maximized with respect to (x12, x13, x23, x123) ≥ 0 subject to the budget constraint of x12 + x13 + x23 + x123 ≤ 1. Similar logic would be used given a larger number of underlyings and larger teaser sizes. It bears mentioning that this process is identical to that which would be used to determine any simultaneous bet staking with fixed parlay odds and the weightings on 1-team parlays constrained to zero. As I said, there's no simple closed-form solution to the problem, but a numeric solution can be easily obtained computationally using an optimization package such as Excel Solver. Using Excel Solver and assuming a 72% win probability for each teaser leg and payout odds for 2-6 team teasers of +100, +180, +300, +465, +750, respectively, one finds that the full-Kelly stake for each of the fifteen 2-team teasers would be 0.5666% of bankroll, the full-Kelly stake for the one 6-team teaser would be 1.3224% of bankroll, with all other full-Kelly teaser stakes at zero. For fifth-Kelly, the 2-team and 6-team stakes would be 0.1160% and 0.2322%, respectively, with all other stakes zero. Results were identical (and much more quickly obtained) using both MINOS and IPOPT, two considerably more robust (and freely available) nonlinear optimization engines.
__________________
|
|||||
|
|
#6 | |||||
|
Quote:
Lets say 10 simultaneous wagers... how long does it take to maximize the growth function? |
|||||
|
|
#7 | |||||
|
Quote:
11 or 12 wagers is where it tends to really slow down, to the point where I can't even get it to run with the available memory (without making numerous dubious approximations in the utility curvce) for 13 or more simultaneous events.
__________________
|
|||||
|
|
#8 | ||||
|
Interesting. Any idea what they're using to perform the optimization?
The algorithms I was using to maximize the growth function are terrible when I try to apply something other than an even money bet, so I'm now working on a solution using simulated annealing to see if I have more success. |
||||
|
|
#9 | |||||
|
Quote:
![]() |
|||||
|
|
#10 | |||||
|
Quote:
"For problems with nonlinear constraints, MINOS uses a sparse SLC algorithm (a projected Lagrangian method, related to Robinson's method). It solves a sequence of sub problems in which the constraints are linearized and the objective is an augmented Lagrangian (involving all nonlinear functions). Convergence is rapid near a solution."
__________________
|
|||||
|
|
#11 | ||||
|
|
||||
|
|
#12 | ||||
|
The original post is talking about related simultaneous wagers, not correlated parlays.
|
||||
![]() |
| Thread Tools | |
| Display Modes | |
|
|