Open Access. Powered by Scholars. Published by Universities.®

Statistical Models Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Statistical Models

Statistical Models For Decision-Making In Professional Soccer, Sean Hellingman Jan 2023

Statistical Models For Decision-Making In Professional Soccer, Sean Hellingman

Theses and Dissertations (Comprehensive)

As soccer is widely regarded as the most popular sport in the world there is high interest in methods of improving team performances. There are many ways teams and individual athletes can influence their own performances during competition. This thesis focuses on developing statistical methodologies for improving competition-based decision-making for soccer so as to allow professional soccer teams to make better informed decisions regarding player selection and in-game decision-making.

To properly capture the dynamic actions of professional soccer, Markov chains with increasing complexity are proposed. These models allow for the inclusion of potential changes in the process caused by goals …


Rock Paper Scissors And Evolutionary Game Theory, Christian Cordova, Rudolf Jovero, Evan Thomas Jan 2018

Rock Paper Scissors And Evolutionary Game Theory, Christian Cordova, Rudolf Jovero, Evan Thomas

Math 365 Class Projects

In Rock Paper Scissors (RPS), three different "species" compete, but no single species has a dominating strategy. In evolutionary game theory, replicator equations model population densities over time. When a mutation is introduced, they are called "replicator-mutator" equations. Using the replicator-mutator equation in [1] we have shown how population density of three species change.


Flipping The Winner Of A Poset Game, Adam O. Kalinich '12 Jan 2011

Flipping The Winner Of A Poset Game, Adam O. Kalinich '12

Student Publications & Research

Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element and all elements greater than it, and whoever takes the last element wins. Examples of poset games include Nim and Chomp. We investigate the complexity of computing which player of a poset game has a winning strategy. We give an inductive procedure that modifies poset games to change the nim-value which informally captures the winning strategies in the game. For a generic …