Moneyballer: An Integer Optimization Framework for Fantasy Cricket League Selection and Substitution Debarghya Das
[email protected] Abstract team’s innings is finished, either because all their 11 players got out or because they finished playing This paper, Moneyballer 1 , uses binary integer program- their allotted time, the second team goes out to bat ming to create optimal sequences of teams in fantasy with the goal of getting as many runs as the first. sports leagues, particularly cricket. Some of the prop- Two batsmen bat together at a time. And if there erties of team selection in sport are very similar to that is only one batsman left to bat, the innings is deter- in finance, which make this problem somewhat similar mined to be over. to the former. We recalibrate our model according to the distinctions between the two. For example, like the The time allotted per team in T20 cricket is 20 • Black-Litterman model, our technique shows theoretical overs. Each over consists of 6 balls or deliveries. guarantees on overall team performance in a league de- Each over is bowled by one member of the bowl- pendent on your predicted return. Like the Markowitz ing team. Consecutive overs cannot be bowled by model, it attempts to optimize on returns, however it does the same bowler. Typically, one innings takes one not penalize for risk and assumes (perhaps incorrectly), to one and a half hours. independence between performance of assets (players). Our model breaks software limits in previous research Each bowler can bowl 4 overs in one innings.