March Madness and the Office Pool
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
March brings March Madness, the annual conclusion to the U.S. men's college basketball season with two single elimination basketball tournaments showcasing the best college teams in the country. Almost as mad is the plethora of office pools across the country where the object is to pick a priori as many game winners as possible in the tournament. More generally, the object in an office pool is to maximize total pool points, where different points are awarded for different correct winning predictions. We consider the structure of single elimination tournaments, and show how to efficiently calculate the mean and the variance of the number of correctly predicted wins (or more generally the total points earned in an office pool) for a given slate of predicted winners. We apply these results to both random and Markov tournaments. We then show how to determine optimal office pool predictions that maximize the expected number of points earned in the pool. Considering various Markov probability models for predicting game winners based on regular season performance, professional sports rankings, and Las Vegas betting odds, we compare our predictions with what actually happened in past NCAA and NIT tournaments. These models perform similarly, achieving overall prediction accuracies of about 58%, but do not surpass the simple strategy of picking the seeds when the goal is to pick as many game winners as possible. For a more sophisticated point structure, however, our models do outperform the strategy of picking the seeds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Kaplan and Garstka (2001) consider a variety of NCAA college basketball pools, and find that the simple strategy of picking the team with the better seed is generally, but not always, optimal.”
From Big ideas in sports analytics and statistical tools for their investigation (2023) · cites this paper as Kaplan and Garstka (2001)
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons
Bradley, R. A., & Terry, M. E. (1952) · Biometrika · doi:10.2307/2334029 · Cited by 2,412
RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS: THE METHOD OF PAIRED COMPARISONS
BRADLEY, R. A., & TERRY, M. E. (1952) · Biometrika · doi:10.1093/biomet/39.3-4.324 · Cited by 1,434
On the Probability of Winning a Football Game
Stern, H. (1991) · The American Statistician · doi:10.1080/00031305.1991.10475798 · Cited by 106
Research works printed but not linked: 12
- Atkins L., 1998, The Detroit News
- Barnhouse W., 1999, Fort Worth Star-Telegram
- Bradley R. A., 1952, Biometrika, 39, 324
- 10.1080/09332480.1997.10554789 · DOI
- Carlin B. P., 1996, Amer. Statist., 50, 39, 10.1080/00031305.1996.10473540 · DOI · Paper page
- 10.1093/biomet/46.1-2.139 · doi:10.1093/biomet/46.1-2.139
- Edwards C. T., 1996, Amer. Statist., 50, 27, 10.1080/00031305.1996.10473538 · doi:10.1080/00031305.1996.10473538
- 10.1080/02664769823106 · doi:10.1080/02664769823106
- 10.1287/opre.33.2.249 · doi:10.1287/opre.33.2.249
- 10.1137/1029011 · doi:10.1137/1029011
- Schwertman N. C., Amer. Statist., 45, 35, 10.1080/00031305.1991.10475762 · DOI · Paper page
- Schwertman N. C., Amer. Statist., 50, 34, 10.1080/00031305.1996.10473539 · DOI
Cited by
Big ideas in sports analytics and statistical tools for their investigation
Baumer, B. S., Matthews, G. J., & Nguyen, Q. (2023) · WIREs Computational Statistics · doi:10.1002/wics.1612 · Cited by 56
Metadata
- Authors
- Kaplan, E. H., & Garstka, S. J.
- Affiliations
- Yale School of Management, New Haven, Connecticut 06520-8200
- Venue
- Management Science
- Published
- 2001-03
- Volume
- 47
- Issue
- 3
- Pages
- 369-382
- ISSN
- 0025-1909
- 1526-5501
- Cited by
- 27
- References
- 3
- Language
- en
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.