Home > Research > Publications & Outputs > A dynamic programming approach to finding optim...
View graph of relations

A dynamic programming approach to finding optimal pitcher substitution strategies in a baseball game

Research output: Working paper

Published
Publication date2003
Place of PublicationLancaster University
PublisherThe Department of Management Science
<mark>Original language</mark>English

Publication series

NameManagement Science Working Paper Series

Abstract

This paper proposes a method for identifying the optimal strategy for substituting pitchers in a baseball game played not under the Designated Hitter rule. Using a Markov Chain model we incorporate the effect of the defensive ability of pitchers using Earned Run Average (ERA) as a measure, and develop a dynamic programming formulation to evaluate the effect of pitcher substitution. The method is illustrated using a match based on the real line-ups of the Colorado Rockies and the San Francisco Giants in the National League of Major League Baseball. We show how this approach may help to determine when to make a substitution and how much the probability of winning increases if the optimal strategy is followed.