Documents disponibles écrits par cet auteur

Optimal batting orders in cricket / J. M. Norman in Journal of the operational research society (JORS), Vol. 61 N° 6 (Juin 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 980–986 Titre : Optimal batting orders in cricket Type de document : texte imprimé Auteurs : J. M. Norman, Auteur ; Clarke, S. R., Auteur Année de publication : 2011 Article en page(s) : pp. 980–986 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Dynamic  programming  Sports  Cricket  Batting  order Index. décimale : 001.424 Résumé : Cricket teams are usually listed on the scoreboard in expected batting order, and although captains can choose to send in any of the remaining batsmen when a wicket falls, they rarely depart from the usual batting order. By optimizing a simplified model using dynamic programming, this paper shows that in all forms of cricket significant increases in expected score result if captains allow a variable batting order and base their decision on the state of the game, rather than using a set batting order. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200954a.html [article] Optimal batting orders in cricket [texte imprimé] / J. M. Norman, Auteur ; Clarke, S. R., Auteur . - 2011 . - pp. 980–986. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 980–986 Mots-clés : Dynamic  programming  Sports  Cricket  Batting  order Index. décimale : 001.424 Résumé : Cricket teams are usually listed on the scoreboard in expected batting order, and although captains can choose to send in any of the remaining batsmen when a wicket falls, they rarely depart from the usual batting order. By optimizing a simplified model using dynamic programming, this paper shows that in all forms of cricket significant increases in expected score result if captains allow a variable batting order and base their decision on the state of the game, rather than using a set batting order. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200954a.html

Optimal challenges in tennis / Clarke, S. R. in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1765–1772 Titre : Optimal challenges in tennis Type de document : texte imprimé Auteurs : Clarke, S. R., Auteur ; J. M. Norman, Auteur Année de publication : 2013 Article en page(s) : pp. 1765–1772 Note générale : operational research Langues : Anglais (eng) Mots-clés : sports;  dynamic  programming;  optimisation;  challenge;  tennis Index. décimale : 001.424 Résumé : The use of technology in sport to assist umpires has been gradually introduced into several sports. This has now been extended to allow players to call upon technology to arbitrate when they disagree with the umpire's decision. Both tennis and cricket now allow the players to challenge a doubtful decision, which is reversed if the evidence shows it to be incorrect. However, the number of challenges is limited, and players must balance any possible immediate gain with the loss of a future right to challenge. With similar challenge rules expected to be introduced in other sports, this situation has been a motivation to consider challenges more widely. We use Dynamic Programming to investigate the optimal challenge strategy and obtain some general rules. In a traditional set of tennis, players should be more aggressive in challenging in the latter stages of the games and sets, and when their opponent is ahead. Optimal challenge strategy can increase a player's chance of winning an otherwise even five-set match to 59%. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011147a.html [article] Optimal challenges in tennis [texte imprimé] / Clarke, S. R., Auteur ; J. M. Norman, Auteur . - 2013 . - pp. 1765–1772. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1765–1772 Mots-clés : sports;  dynamic  programming;  optimisation;  challenge;  tennis Index. décimale : 001.424 Résumé : The use of technology in sport to assist umpires has been gradually introduced into several sports. This has now been extended to allow players to call upon technology to arbitrate when they disagree with the umpire's decision. Both tennis and cricket now allow the players to challenge a doubtful decision, which is reversed if the evidence shows it to be incorrect. However, the number of challenges is limited, and players must balance any possible immediate gain with the loss of a future right to challenge. With similar challenge rules expected to be introduced in other sports, this situation has been a motivation to consider challenges more widely. We use Dynamic Programming to investigate the optimal challenge strategy and obtain some general rules. In a traditional set of tennis, players should be more aggressive in challenging in the latter stages of the games and sets, and when their opponent is ahead. Optimal challenge strategy can increase a player's chance of winning an otherwise even five-set match to 59%. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011147a.html