Dynamic programming in cricket: choosing a night watchman

DOI10.1057/PALGRAVE.JORS.2601527MaRDI QIDQ4661087zbMATH OpenOpenAlexFDO

Authors Stephen R. Clarke, John M. Norman

Publication date 4 April 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.2601527

zbMATH Keywords

cricketdynamic programmingnight watchmansports

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1234738
• To run or not?: Some dynamic programming models in cricket
• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• Optimal batting orders in one-day cricket
• A successful operational research intervention in one-day cricket

Cited in

(5)

• Dynamic programming analysis of the TV game ``Who wants to be a millionaire?
• Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
• To run or not?: Some dynamic programming models in cricket
• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• scientific article; zbMATH DE number 1234738 (Why is no real title available?)

This page was built for publication: Dynamic programming in cricket: choosing a night watchman

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