IDEAS home Printed from https://ideas.repec.org/a/bpj/jqsprt/v14y2018i4p173-183n3.html
   My bibliography  Save this article

Predicting the NCAA basketball tournament using isotonic least squares pairwise comparison model

Author

Listed:
  • Neudorfer Ayala
  • Rosset Saharon

    (Tel Aviv University, Department of Statistics and Operations Research, Tel Aviv 69978, Israel)

Abstract

Each year, millions of people fill out a bracket to predict the outcome of the popular NCAA men’s college basketball tournament, known as March Madness. In this paper we present a new methodology for team ranking and use it to predict the NCAA basketball tournament. We evaluate our model in Kaggle’s March Machine Learning Mania competition, in which contestants were required to predict the results of all possible games in the tournament. Our model combines two methods: the least squares pairwise comparison model and isotonic regression. We use existing team rankings (such as seeds, Sagarin and Pomeroy ratings) and look for a monotonic, non-linear relationship between the ranks’ differences and the probability to win a game. We use the isotonic property to get new rankings that are consistent with both the observed outcomes of past tournaments and previous knowledge about the order of the teams. In the 2016 and 2017 competitions, submissions based on our methodology consistently placed in the top 5% out of over 800 other submissions. Using simulations, we show that the suggested model is usually better than commonly used linear and logistic models that use the same variables.

Suggested Citation

  • Neudorfer Ayala & Rosset Saharon, 2018. "Predicting the NCAA basketball tournament using isotonic least squares pairwise comparison model," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 14(4), pages 173-183, December.
  • Handle: RePEc:bpj:jqsprt:v:14:y:2018:i:4:p:173-183:n:3
    DOI: 10.1515/jqas-2018-0039
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/jqas-2018-0039
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/jqas-2018-0039?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:jqsprt:v:14:y:2018:i:4:p:173-183:n:3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.