Mason Archival Repository Service

An Approximate Dynamic Programming Approach to Determine the Optimal Substitution Strategy for Basketball

Show simple item record

dc.contributor.advisor Shortle, John F.
dc.contributor.author Hughes, David William
dc.creator Hughes, David William
dc.date.accessioned 2018-10-22T01:21:17Z
dc.date.available 2018-10-22T01:21:17Z
dc.date.issued 2017
dc.identifier.uri https://hdl.handle.net/1920/11308
dc.description.abstract The purpose of this research is to determine a coach’s optimal basketball lineup throughout the course of a game while accounting for players’ changing endurance levels. Coaches currently use a variety of substitution strategies in basketball. These include player rotations, heuristics, playing the “next best” player, and others. However, such strategies may not be optimal in terms of distributing rest over the course of a whole game. In part, this is because live, in-game monitoring of physiological factors, such as heart rates, is not currently authorized by the NCAA. Even with such data, it may not be obvious when to rest a skilled player in order to ensure that player is fresh for later portions of the game. This research develops an approximate dynamic programming (ADP) model of a coach’s basketball lineup decisions accounting for changing players’ endurance levels and the uncertainty of the defensive intensity played against them. The ADP model is quantified via offline endurance data as well as a value hierarchy of player skill sets created from discussions with the head coach of a Division I program. Policy implications resulting from the model are analyzed and compared to other solution methods. The analysis shows that lineups generated from the ADP model consistently provide more overall value when compared with other substitution strategies, such as the “next best” (or greedy) strategy. This difference tends to be greater for games in which low-intensity defense is played. Knowing each players’ current endurance level, their value at each endurance level, and their likelihood of transitioning between endurance levels could help a coach determine a better substitution strategy.
dc.format.extent 127 pages
dc.language.iso en
dc.rights Copyright 2017 David William Hughes
dc.subject Operations research en_US
dc.subject Engineering en_US
dc.subject Basketball Substitutions en_US
dc.subject Decision-making in Sports en_US
dc.subject Dynamic Programming en_US
dc.subject Endurance in Sports en_US
dc.subject Fatigue and Recovery Rates en_US
dc.subject Optimal Substitution Strategies en_US
dc.title An Approximate Dynamic Programming Approach to Determine the Optimal Substitution Strategy for Basketball
dc.type Dissertation
thesis.degree.level Ph.D.
thesis.degree.discipline Systems Engineering and Operations Research
thesis.degree.grantor George Mason University


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search MARS


Advanced Search

Browse

My Account

Statistics