Optimal batting orders in run-limit-rule baseball: A Markov chain approach

7Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Amateur baseball contests, particularly those involving young players, often feature a run limit, which establishes a maximum number of runs that may be scored in a half-inning of play. Although conventional wisdom can be used for designing the batting order under standard baseball rules, the composition of the optimal lineup under run limit is still unclear, and the best batting order could differ significantly from the traditional ordering. In this paper, we consider the impact of run limits on the design of the optimal batting order, by developing a Markov chain model for calculating the expected number of runs scored (ENRS) under 3-and 5-run limits. We apply this model to both a high-quality and a lower-quality team, using the data from the 2011 Little League World Series, and illustrate the effect of run limit on the ENRS and the optimal batting order.

Cite

CITATION STYLE

APA

Hirotsu, N., & Eric Bickel, J. (2016). Optimal batting orders in run-limit-rule baseball: A Markov chain approach. IMA Journal of Management Mathematics, 27(2), 297–313. https://doi.org/10.1093/imaman/dpu024

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free