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

AccuV College Football Ranking Model

Author

Listed:
  • Miles William W

    (Stetson University)

  • Fowks Gary T

    (Stetson University)

  • Coulter Lisa O

    (Stetson University)

Abstract

This work extends the work of Coleman (2005) which provides a football rankings system that minimizes game score violations. The modified model, called AccuV, developed in this paper incorporates several other aspects of most rankings systems including: strength of schedule, margin of victory, and home field advantage. These other components of a team's rank are included via an additional variable called the composite index. In addition to these new components, other bounding constraints have been added. These new constraints significantly reduce the solve-time of the model. The model of (Coleman, 2005) achieved a minimum of 55 game score violations for the complete 2002 season in about 36 seconds with 234,313 iterations as reported by LINGO. However, with the addition of the new constraints, the new model (without the additional ranking components) established the same minimum in only 6 seconds with a total of 55,119 iterations. This work is also easily extendable to allow the addition of other components if desired.

Suggested Citation

  • Miles William W & Fowks Gary T & Coulter Lisa O, 2010. "AccuV College Football Ranking Model," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 6(3), pages 1-17, July.
    • Handle: RePEc:bpj:jqsprt:v:6:y:2010:i:3:n:10
    DOI: 10.2202/1559-0410.1189
    as

    Download full text from publisher

    File URL: https://doi.org/10.2202/1559-0410.1189
    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.2202/1559-0410.1189?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.

    References listed on IDEAS

    as
    1. Martin Grötschel & Michael Jünger & Gerhard Reinelt, 1984. "A Cutting Plane Algorithm for the Linear Ordering Problem," Operations Research, INFORMS, vol. 32(6), pages 1195-1220, December.
    2. B. Jay Coleman, 2005. "Minimizing Game Score Violations in College Football Rankings," Interfaces, INFORMS, vol. 35(6), pages 483-496, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. B. Jay Coleman, 2014. "Minimum violations and predictive meta‐rankings for college football," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 17-33, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jose Apesteguia & Miguel A. Ballester, 2015. "A Measure of Rationality and Welfare," Journal of Political Economy, University of Chicago Press, vol. 123(6), pages 1278-1310.
    2. Michael J. Brusco & Douglas Steinley & Ashley L. Watts, 2022. "Disentangling relationships in symptom networks using matrix permutation methods," Psychometrika, Springer;The Psychometric Society, vol. 87(1), pages 133-155, March.
    3. W. Art Chaovalitwongse & Carlos A. S. Oliveira & Bruno Chiarini & Panos M. Pardalos & Mauricio G. C. Resende, 2011. "Revised GRASP with path-relinking for the linear ordering problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 572-593, November.
    4. Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).
    5. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    6. Sebastián Cea & Guillermo Durán & Mario Guajardo & Denis Sauré & Joaquín Siebert & Gonzalo Zamorano, 2020. "An analytics approach to the FIFA ranking procedure and the World Cup final draw," Annals of Operations Research, Springer, vol. 286(1), pages 119-146, March.
    7. Miguel F. Anjos & Anthony Vannelli, 2008. "Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 611-617, November.
    8. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. P. Detti & D. Pacciarelli, 2001. "A branch and bound algorithm for the minimum storage‐time sequencing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 313-331, June.
    10. Csató, László, 2013. "Rangsorolás páros összehasonlításokkal. Kiegészítések a felvételizői preferencia-sorrendek módszertanához [Paired comparisons ranking. A supplement to the methodology of application-based preferenc," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(12), pages 1333-1353.
    11. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    12. B. Jay Coleman, 2005. "Minimizing Game Score Violations in College Football Rankings," Interfaces, INFORMS, vol. 35(6), pages 483-496, December.
    13. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    14. G Kendall, 2008. "Scheduling English football fixtures over holiday periods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 743-755, June.
    15. B. Jay Coleman, 2014. "Minimum violations and predictive meta‐rankings for college football," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 17-33, February.
    16. Shai Bernstein & Eyal Winter, 2012. "Contracting with Heterogeneous Externalities," American Economic Journal: Microeconomics, American Economic Association, vol. 4(2), pages 50-76, May.
    17. Burer Samuel, 2012. "Robust Rankings for College Football," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 8(2), pages 1-22, June.
    18. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
    19. Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
    20. Rajeev Kohli & Khaled Boughanmi & Vikram Kohli, 2019. "Randomized Algorithms for Lexicographic Inference," Operations Research, INFORMS, vol. 67(2), pages 357-375, March.

    More about this item

    Statistics

    Access and download statistics

    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:6:y:2010:i:3:n:10. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.