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

DOI10.1057/PALGRAVE.JORS.2600705MaRDI QIDQ3157359zbMATH OpenOpenAlexFDO

Authors Stephen R. Clarke, John M. Norman

Publication date 13 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600705

zbMATH Keywords

cricketdynamic programmingMarkov processessports

Mathematics Subject Classification ID

General applied mathematics (00A69) Dynamic programming (90C39) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 1234738
• Dynamic programming in cricket: choosing a night watchman
• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• A successful operational research intervention in one-day cricket
• Optimal batting orders in one-day cricket

Cited in

(5)

• When to rush a ‘behind’ in Australian rules football: a dynamic programming approach
• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• scientific article; zbMATH DE number 1234738 (Why is no real title available?)
• Dynamic programming in cricket: choosing a night watchman
• Modelling curling as a Markov process

This page was built for publication: To run or not?: Some dynamic programming models in cricket

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157359)