Hall’s Marriage Theorem Meets the DraftKings Entry Form

This is the last post in my accidental Fourier-Motzkin trilogy (part one: the method; part two: the baseball lineups), and it’s about the bill coming due. Because when you use elimination to throw variables out of a model, the mathematics is very clear about what you keep — and very quiet about what you lose. I found out exactly what I’d lost the first time DraftKings rejected a lineup my spreadsheet swore was legal. The story runs straight through a beautiful piece of combinatorics called Hall’s marriage theorem, so we’ll pick that up along the way.

Continue reading “Hall’s Marriage Theorem Meets the DraftKings Entry Form”

A neural network approach to college football rankings

The usual image of an artificial neural network:

Single-layer feedforward artificial neural network diagram

What follows is a paper that I wrote in the Spring of 2001 for an “Introduction to Neural Networks” class that I took as part of my Master’s degree. It is mostly a review of someone else’s paper on the subject, except that I wrote the network in Excel and ran it on that year’s football season games. Fun, fun.

Continue reading “A neural network approach to college football rankings”

A Fourier-Motzkin Elimination Example: DraftKings Lineups

In my last post about Fourier-Motzkin elimination I promised a real example involving baseball, and I keep my promises. This is the story of how a dusty 19th-century math trick ended up picking my daily fantasy lineups — and how I stumbled into a genuine Fourier-Motzkin elimination example without fully realizing that’s what I was doing until much later.

Continue reading “A Fourier-Motzkin Elimination Example: DraftKings Lineups”

Fourier-Motzkin Elimination: An Old Trick I Still Use

Fourier-Motzkin elimination is one of those methods that gets a page and a half in the linear programming textbooks, right before the simplex method shows up and steals the whole show. I was first introduced to it while working as an OR analyst at Cargill, and my honest first reaction was: nice, but why would I ever use this? It took me years (and one very stubborn model) to change my mind. This post is the explanation I wish someone had given me back then: what the method actually does, how the mechanics work, and a small worked example showing a model before and after the elimination.

Continue reading “Fourier-Motzkin Elimination: An Old Trick I Still Use”

McNemar’s test and Simpson’s Paradox (and the “hot hand” in basketball)

hot hand basketball

(I wrote this paper in 2007 for a Statistics class I took while trying to do a Ph.D. I am sharing it here for posterity.)

McNemar’s test is a non-parametric method used on nominal data to determine whether the row and column marginal frequencies are equal. It is applied to 2×2 contingency tables with a dichotomous trait with matched pairs of subjects.

Simpson’s paradox is a statistical paradox in which the successes of several groups seem to be reversed when the groups are combined. This seemingly impossible result is encountered often in social science statistics and occurs when a weighting variable, which is not relevant to the individual group assessment, must be used in the combined assessment.

The paper evaluates the potential effect of Simpson’s paradox in McNemar’s test results and conclusions.


Continue reading “McNemar’s test and Simpson’s Paradox (and the “hot hand” in basketball)”