Reconsideration of the Best Batting Order in Baseball: Is the Order to Maximize the Expected Number of Runs Really the Best?
In previous studies for analyzing the batting order of baseball games, the order is evaluated by its expected number of runs scored in a game, under the Markov chain model on the DEsopo and Lefkowitz runner advancement model. However, the order to maximize the expected number of runs may not be the best order in the sense that it may not get more than 0.5 in probability of winning the game against other possible batting orders. In this sense, the best batting order is reconsidered, and it is tried to find better orders than the order which maximizes the expected number of runs. In this paper, the existence of such orders and the difference between the best orders and the order to maximize the expected number of runs are concretely shown by taking into account of not only the expected number of runs but also the standard deviation of runs, based on the data of Major League teams.
Volume (Year): 7 (2011)
Issue (Month): 2 (May)
|Contact details of provider:|| Web page: http://www.degruyter.com|
|Order Information:||Web: http://www.degruyter.com/view/j/jqas|
When requesting a correction, please mention this item's handle: RePEc:bpj:jqsprt:v:7:y:2011:i:2:n:13. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Peter Golla)
If references are entirely missing, you can add them using this form.