To run or not?: Some dynamic programming models in cricket

被引:15
|
作者
Clarke, SR
Norman, JM
机构
[1] Swinburne Univ Technol, Sch Math Sci, Hawthorn, Vic 3122, Australia
[2] Univ Sheffield, Sheffield S10 2TN, S Yorkshire, England
关键词
cricket; dynamic programming; Markov processes; sports;
D O I
10.2307/3010003
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:536 / 545
页数:10
相关论文
共 50 条