10:00 AM - 10:20 AM
[2I1-GS-5a-04] Computing Offensive Strategies of American Football via Counterfactual Regret Minimization
Keywords:Game Theory, Nash Equilibrium, Sports Analytics
In this research, we compute offensive strategies of American Football via Counterfactual Regret Minimization (CFR). American Football is one of the highest strategic sports that offense and defense need to anticipate what the other think. We thus analyze their strategies in game-theoretical framework assuming they are rational players.
On the other hand, CFR is the well-known algorithm for computing approximate Nash equilibria in imperfect information extensive-form games. Our goal is that we construct CFR algorithm to compute offense's equilibrium strategies according to National Football League play-by-play data. Our simulation suggests that the proposed algorithm finds offensive strategies that are observed in the data.
On the other hand, CFR is the well-known algorithm for computing approximate Nash equilibria in imperfect information extensive-form games. Our goal is that we construct CFR algorithm to compute offense's equilibrium strategies according to National Football League play-by-play data. Our simulation suggests that the proposed algorithm finds offensive strategies that are observed in the data.
Authentication for paper PDF access
A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.