To run or not?: Some dynamic programming models in cricket
S R Clarke () and
J M Norman
Additional contact information
S R Clarke: Swinburne University of Technology
J M Norman: Sheffield University
Journal of the Operational Research Society, 1999, vol. 50, issue 5, 536-545
Abstract:
Abstract In cricket, particularly near the end of an innings, batsmen of different abilities need to manage the rate at which they score runs. Either batsman can choose to bat aggressively or defensively, which alters their chances of scoring runs or being dismissed. Since they change ends when they score a run and at the end of an over, by scoring an odd or even number of runs the two batsmen also determine which of them will face the next ball. It may be worthwhile to refuse a run to keep the slower or lower scoring batsman from the strike. Some dynamic programming models are developed which could be used to maximise the total number of runs scored.
Keywords: cricket; dynamic programming; Markov processes; sports (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (9)
Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600705 Abstract (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600705
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
DOI: 10.1057/palgrave.jors.2600705
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().