Dynamic programming in cricket: optimizing batting order for a sticky wicket

Dynamic programming in cricket: optimizing batting order for a sticky wicket

0.00 Avg rating0 Votes
Article ID: iaor20083979
Country: United Kingdom
Volume: 58
Issue: 12
Start Page Number: 1678
End Page Number: 1682
Publication Date: Dec 2007
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: programming: dynamic
Abstract:

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent in to ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.

Reviews

Required fields are marked *. Your email address will not be published.